ABSTRACT
Ride sourcing services such as Uber and Lyft have become widespread in large cities for everyday mobility. When matching passengers, these services attempt to optimize cost savings at a global level. However, a possible scenario is that a passenger A is matched to passenger B even though if A were matched to passenger C, then both A and C would have saved more money. This introduces the concept of "fairness" in ride sharing, which consists of finding the Nash equilibrium in ridesharing. In this paper we compare optimum and fair ridesharing theoretically and experimentally. We show that although theoretically the gap between fair and optimum is large, in practice it is very small.
- J. Alonso-Mora, S. Samaranayake, A. Wallar, E. Frazzoli, and D. Rus. 2017. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences (2017).Google Scholar
- D. Ayala, O. Wolfson, B. Xu, B. Dasgupta, and J. Lin. 2011. Parking slot assignment games. In Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM. Google ScholarDigital Library
- B. Chandra and M. M. Halldórsson. 2001. Greedy local improvement and weighted set packing approximation. Journal of Algorithms 39, 2 (2001). Google ScholarDigital Library
- X. Fu, J. Huang, H. Lu, J. Xu, and Y. Li. 2017. Top-k Taxi Recommendation in Realtime Social-Aware Ridesharing Services. In Int. SSTD. Springer.Google Scholar
- Y. Huang, F. Bastani, R. Jin, and X. S. Wang. 2014. Large scale real-time ridesharing with service guarantee on road networks. Proc. VLDB (2014). Google ScholarDigital Library
- J. Lin, S. Sasidharan, S. Ma, and O. Wolfson. A Model of Multimodal Ridesharing and its Analysis. In IEEE MDM 2016.Google ScholarCross Ref
- S. Ma, Y. Zheng, and O. Wolfson. T-share: A large-scale dynamic taxi ridesharing service. In IEEE ICDE (2013).Google Scholar
- S. Ma, Y. Zheng, and O Wolfson. 2015. Real-time city-scale taxi ridesharing. IEEE Transactions on Knowledge and Data Engineering 27, 7 (2015).Google Scholar
- X. Qian, W. Zhang, S. Ukkusuri, and C. Yang. 2017. Optimal assignment and incentive design in the taxi group ride problem. Transportation Research Part B (2017).Google Scholar
- P. Santi, G. Resta, M.l Szell, S. Sobolevsky, S. H. Strogatz, and C. Ratti. 2014. Quantifying the benefits of vehicle pooling with shareability networks. Proceedings of the National Academy of Sciences 111, 37 (2014).Google Scholar
- A. J. T. Swoboda. 2015. New York City Taxicab Transportation Demand Modeling for the Analysis of Ridesharing and Autonomous Taxi Systems. (2015).Google Scholar
- O. Wolfson and J. Lin. 2017. Fairness versus Optimality in Ridesharing. Proc. MDM (2017).Google Scholar
Index Terms
- The Nash Equilibrium Among Taxi Ridesharing Partners
Recommendations
On Ridesharing Competition and Accessibility: Evidence from Uber, Lyft, and Taxi
WWW '18: Proceedings of the 2018 World Wide Web ConferenceRidesharing services such as Uber and Lyft have become an important part of the Vehicle For Hire (VFH) market, which used to be dominated by taxis. Unfortunately, ridesharing services are not required to share data like taxi services, which has made it ...
Real-Time City-Scale Taxi Ridesharing
We proposed and developed a taxi-sharing system that accepts taxi passengers' real-time ride requests sent from smart phones and schedules proper taxis to pick up them via ride sharing, subject to time, capacity, and monetary constraints. The monetary ...
Optimum versus Nash-equilibrium in taxi ridesharing
AbstractIn recent years, Transportation Network Companies (TNC) such as Uber and Lyft have embraced ridesharing: a passenger who requests a ride may decide to save money in exchange for the inconvenience of sharing the ride with someone else and incurring ...
Comments