Decentralized Ride-Sharing and Vehicle-Pooling Based on Fair Cost-Sharing Mechanisms
Sid Chi-Kin Chau, Shuning Shen, Yue Zhou

TL;DR
This paper explores decentralized ride-sharing mechanisms based on fair cost-sharing and stable matching principles, analyzing their theoretical properties and empirical performance using NYC taxi data.
Contribution
It introduces and compares fair cost-sharing mechanisms for decentralized ride-sharing, analyzing their stability and efficiency relative to social optimality.
Findings
Several fair cost-sharing mechanisms achieve high social optimality ratios.
Stable matching outcomes can closely approximate the social optimal solution.
Empirical analysis on NYC taxi data supports the effectiveness of proposed mechanisms.
Abstract
Ride-sharing or vehicle-pooling allows commuters to team up spontaneously for transportation cost sharing. This has become a popular trend in the emerging paradigm of sharing economy. One crucial component to support effective ride-sharing is the matching mechanism that pairs up suitable commuters. Traditionally, matching has been performed in a centralized manner, whereby an operator arranges ride-sharing according to a global objective (e.g., total cost of all commuters). However, ride-sharing is a decentralized decision-making paradigm, where commuters are self-interested and only motivated to team up based on individual payments. Particularly, it is not clear how transportation cost should be shared fairly between commuters, and what ramifications of cost-sharing are on decentralized ride-sharing. This paper sheds light on the principles of decentralized ride-sharing and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
