DeepAI AI Chat
Log In Sign Up

Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources

by   John P Dickerson, et al.
University of Maryland

Bipartite matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. Prior work addresses online bipartite matching markets, where agents arrive over time and are dynamically matched to a known set of disposable resources. In this paper, we propose a new model, Online Matching with (offline) Reusable Resources under Known Adversarial Distributions (OM-RR-KAD), in which resources on the offline side are reusable instead of disposable; that is, once matched, resources become available again at some point in the future. We show that our model is tractable by presenting an LP-based adaptive algorithm that achieves an online competitive ratio of 1/2 - eps for any given eps greater than 0. We also show that no non-adaptive algorithm can achieve a ratio of 1/2 + o(1) based on the same benchmark LP. Through a data-driven analysis on a massive openly-available dataset, we show our model is robust enough to capture the application of taxi dispatching services and ride-sharing systems. We also present heuristics that perform well in practice.


page 1

page 2

page 3

page 4


Periodic Reranking for Online Matching of Reusable Resources

We consider a generalization of the vertex weighted online bipartite mat...

A Unified Model for the Two-stage Offline-then-Online Resource Allocation

With the popularity of the Internet, traditional offline resource alloca...

Exploring the Tradeoff between Competitive Ratio and Variance in Online-Matching Markets

In this paper, we propose an online-matching-based model to study the as...

Fairness Maximization among Offline Agents in Online-Matching Markets

Matching markets involve heterogeneous agents (typically from two partie...

An Optimization Framework For Online Ride-sharing Markets

Taxi services and product delivery services are instrumental for our mod...

Adaptive Matching for Expert Systems with Uncertain Task Types

Online two-sided matching markets such as Q&A forums (e.g. StackOverflow...

Online Bipartite Matching with Reusable Resources

We study the classic online bipartite matching problem with a twist: off...