Online Matching in a Ride-Sharing Platform

Chris Sholley
Chris Sholley

arXiv: Data Structures and Algorithms, Volume abs/1806.10327, 2018.

被引用1|浏览3
EI

摘要

We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model, that we call {em Online Windowed Non-Bipartite Matching} ($mbox{OWNBM}$), pertains to online matching in {em non-bipartite} graphs. We show that the edge-weigh...更多

代码

数据

24小时获取PDF
引用
您的评分 :
0

 

标签
评论