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

Document Type

Article

Publication Date

9-1-2021

Abstract

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 article, 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 non-adaptive algorithm that achieves an online competitive ratio of ½- μ for any given constant μ > 0. We also show that no adaptive algorithm can achieve a ratio of ½ + 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.

Identifier

85113151457 (Scopus)

Publication Title

ACM Transactions on Economics and Computation

External Full Text Location

https://doi.org/10.1145/3456756

e-ISSN

21678383

ISSN

21678375

Issue

3

Volume

9

Grant

CCF-1422569

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS