skip to main content
10.1145/3139958.3140028acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
poster
Public Access

The Nash Equilibrium Among Taxi Ridesharing Partners

Published:07 November 2017Publication History

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.

References

  1. 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 ScholarGoogle Scholar
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Chandra and M. M. Halldórsson. 2001. Greedy local improvement and weighted set packing approximation. Journal of Algorithms 39, 2 (2001). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle Scholar
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Lin, S. Sasidharan, S. Ma, and O. Wolfson. A Model of Multimodal Ridesharing and its Analysis. In IEEE MDM 2016.Google ScholarGoogle ScholarCross RefCross Ref
  7. S. Ma, Y. Zheng, and O. Wolfson. T-share: A large-scale dynamic taxi ridesharing service. In IEEE ICDE (2013).Google ScholarGoogle Scholar
  8. 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 ScholarGoogle Scholar
  9. 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 ScholarGoogle Scholar
  10. 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 ScholarGoogle Scholar
  11. A. J. T. Swoboda. 2015. New York City Taxicab Transportation Demand Modeling for the Analysis of Ridesharing and Autonomous Taxi Systems. (2015).Google ScholarGoogle Scholar
  12. O. Wolfson and J. Lin. 2017. Fairness versus Optimality in Ridesharing. Proc. MDM (2017).Google ScholarGoogle Scholar

Index Terms

  1. The Nash Equilibrium Among Taxi Ridesharing Partners

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGSPATIAL '17: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
        November 2017
        677 pages
        ISBN:9781450354905
        DOI:10.1145/3139958

        Copyright © 2017 Owner/Author

        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 7 November 2017

        Check for updates

        Qualifiers

        • poster
        • Research
        • Refereed limited

        Acceptance Rates

        SIGSPATIAL '17 Paper Acceptance Rate39of193submissions,20%Overall Acceptance Rate220of1,116submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader