IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v102y2021ics0305048320307052.html
   My bibliography  Save this article

Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability

Author

Listed:
  • Yan, Pengyu
  • Lee, Chung-Yee
  • Chu, Chengbin
  • Chen, Cynthia
  • Luo, Zhiqin

Abstract

In ride-sharing, a sustainable transportation mode, drivers share idle seats with riders. This paper addresses two key subproblems to find a ride-sharing solution: matching drivers and riders to achieve the system-wide optimality and allocating the resulting travel-cost saving among them by considering their self interests or the stability of the solution. Solutions to either subproblem significantly affect the efficiency of overall dynamic ride-sharing systems measured in total travel-cost saving and individual benefits of people involved. We evaluate the worst-case performance of the best stable solutions associated with four ridematching-defined pricing methods existing in the literature and widely used in practice. We then analyze a Vickrey-Clarke-Groves (VCG)-based pricing mechanism that lets the system achieve optimal system efficiency, prove its stability, and identify its drawbacks such as budget unbalance. We formulate the matching subproblem to maximize the total travel-cost saving and propose a simple and consistent pricing method to guarantee that the resulting ride-sharing solution not only is stable and system-wide optimal but also makes the system deficit-free and thus financially sustainable. Furthermore, such a ride-sharing solution can be obtained in polynomial time. In the numerical experiments, we evaluate our method against existing ones through a real-life instance and randomly generated instances in a dynamic environment.

Suggested Citation

  • Yan, Pengyu & Lee, Chung-Yee & Chu, Chengbin & Chen, Cynthia & Luo, Zhiqin, 2021. "Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability," Omega, Elsevier, vol. 102(C).
    • Handle: RePEc:eee:jomega:v:102:y:2021:i:c:s0305048320307052
    DOI: 10.1016/j.omega.2020.102351
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048320307052
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2020.102351?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    2. Maike Hoffmann & Peter Sudhölter, 2007. "The Shapley value of exact assignment games," International Journal of Game Theory, Springer;Game Theory Society, vol. 35(4), pages 557-568, April.
    3. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    4. Rinaldi, Marco & Picarelli, Erika & D'Ariano, Andrea & Viti, Francesco, 2020. "Mixed-fleet single-terminal bus scheduling problem: Modelling, solution scheme and potential applications," Omega, Elsevier, vol. 96(C).
    5. Stiglic, M. & Agatz, N.A.H. & Savelsbergh, M.W.P. & Gradisar, M., 2015. "The Benefits of Meeting Points in Ride-sharing Systems," ERIM Report Series Research in Management ERS-2015-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    6. Xu, Zhengtian & Yin, Yafeng & Ye, Jieping, 2020. "On the supply curve of ride-hailing systems," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 29-43.
    7. Sotomayor, Marilda, 2000. "Existence of stable outcomes and the lattice property for a unified matching market," Mathematical Social Sciences, Elsevier, vol. 39(2), pages 119-132, March.
    8. Lei Tang & Zongtao Duan & Yaling Zhao, 2019. "Toward using social media to support ridesharing services: challenges and opportunities," Transportation Planning and Technology, Taylor & Francis Journals, vol. 42(4), pages 355-379, May.
    9. Stiglic, Mitja & Agatz, Niels & Savelsbergh, Martin & Gradisar, Mirko, 2015. "The benefits of meeting points in ride-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 36-53.
    10. Stiglic, Mitja & Agatz, Niels & Savelsbergh, Martin & Gradisar, Mirko, 2016. "Making dynamic ride-sharing work: The impact of driver and rider flexibility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 190-207.
    11. Kaneko, Mamoru, 1982. "The central assignment game and the assignment markets," Journal of Mathematical Economics, Elsevier, vol. 10(2-3), pages 205-232, September.
    12. Agatz, Niels A.H. & Erera, Alan L. & Savelsbergh, Martin W.P. & Wang, Xing, 2011. "Dynamic ride-sharing: A simulation study in metro Atlanta," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1450-1464.
    13. Nair, Gopindra S. & Bhat, Chandra R. & Batur, Irfan & Pendyala, Ram M. & Lam, William H.K., 2020. "A model of deadheading trips and pick-up locations for ride-hailing service vehicles," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 289-308.
    14. An, Qingxian & Wen, Yao & Ding, Tao & Li, Yongli, 2019. "Resource sharing and payoff allocation in a three-stage system: Integrating network DEA with the Shapley value method," Omega, Elsevier, vol. 85(C), pages 16-25.
    15. Al-Kanj, Lina & Nascimento, Juliana & Powell, Warren B., 2020. "Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1088-1106.
    16. Furuhata, Masabumi & Dessouky, Maged & Ordóñez, Fernando & Brunet, Marc-Etienne & Wang, Xiaoqing & Koenig, Sven, 2013. "Ridesharing: The state-of-the-art and future directions," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 28-46.
    17. Bian, Zheyong & Liu, Xiang, 2019. "Mechanism design for first-mile ridesharing based on personalized requirements part II: Solution algorithm for large-scale problems," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 172-192.
    18. T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 177-185.
    19. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    20. Satoru Fujishige & Akihisa Tamura, 2007. "A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 136-155, February.
    21. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tafreshian, Amirmahdi & Masoud, Neda, 2022. "A truthful subsidy scheme for a peer-to-peer ridesharing market with incomplete information," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 130-161.
    2. Keith, David R. & Naumov, Sergey & Rakoff, Hannah E. & Sanches, Lars Meyer & Singh, Anuraag, 2024. "The effect of increasing vehicle utilization on the automotive industry," European Journal of Operational Research, Elsevier, vol. 317(3), pages 776-792.
    3. Hu, Xinru & Zhou, Shuiyin & Luo, Xiaomeng & Li, Jianbin & Zhang, Chi, 2024. "Optimal pricing strategy of an on-demand platform with cross-regional passengers," Omega, Elsevier, vol. 122(C).
    4. Auad, Ramon & Erera, Alan & Savelsbergh, Martin, 2023. "Courier satisfaction in rapid delivery systems using dynamic operating regions," Omega, Elsevier, vol. 121(C).
    5. Nie, Fapeng & Li, Xiang & Zhou, Chang, 2024. "Impact of privacy regulation involving information collection on the ride-hailing market," Omega, Elsevier, vol. 126(C).
    6. P.Delle Site & André de Palma & Samarth Ghoslya, 2024. "Matching and fair pricing of socially optimal, stable and financially sustainable ride-sharing in congestible networks," THEMA Working Papers 2024-06, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    7. Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
    8. Ausseil, Rosemonde & Ulmer, Marlin W. & Pazour, Jennifer A., 2024. "Online acceptance probability approximation in peer-to-peer transportation," Omega, Elsevier, vol. 123(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Stumpe, Miriam & Dieter, Peter & Schryen, Guido & Müller, Oliver & Beverungen, Daniel, 2024. "Designing taxi ridesharing systems with shared pick-up and drop-off locations: Insights from a computational study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 183(C).
    2. Ruijie Li & Yu (Marco) Nie & Xiaobo Liu, 2020. "Pricing Carpool Rides Based on Schedule Displacement," Transportation Science, INFORMS, vol. 54(4), pages 1134-1152, July.
    3. Stiglic, M. & Agatz, N.A.H. & Savelsbergh, M.W.P. & Gradisar, M., 2016. "Enhancing Urban Mobility: Integrating Ride-sharing and Public Transit," ERIM Report Series Research in Management ERS-2016-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    4. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    5. Wang, Jing-Peng & Ban, Xuegang (Jeff) & Huang, Hai-Jun, 2019. "Dynamic ridesharing with variable-ratio charging-compensation scheme for morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 390-415.
    6. Peng, Zixuan & Shan, Wenxuan & Zhu, Xiaoning & Yu, Bin, 2022. "Many-to-one stable matching for taxi-sharing service with selfish players," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 255-279.
    7. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    8. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    9. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    10. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem & Yacine Rekik, 2022. "Environmental and social implications of incorporating carpooling service on a customized bus system," Post-Print hal-03598768, HAL.
    11. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    12. Ke, Jintao & Yang, Hai & Li, Xinwei & Wang, Hai & Ye, Jieping, 2020. "Pricing and equilibrium in on-demand ride-pooling markets," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 411-431.
    13. Long, Jiancheng & Tan, Weimin & Szeto, W.Y. & Li, Yao, 2018. "Ride-sharing with travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 143-171.
    14. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    15. Tian, Li-Jun & Sheu, Jiuh-Biing & Huang, Hai-Jun, 2019. "The morning commute problem with endogenous shared autonomous vehicle penetration and parking space constraint," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 258-278.
    16. Xiaolei Wang & Hai Yang & Daoli Zhu, 2018. "Driver-Rider Cost-Sharing Strategies and Equilibria in a Ridesharing Program," Transportation Science, INFORMS, vol. 52(4), pages 868-881, August.
    17. Zixuan Peng & Wenxuan Shan & Peng Jia & Bin Yu & Yonglei Jiang & Baozhen Yao, 2020. "Stable ride-sharing matching for the commuters with payment design," Transportation, Springer, vol. 47(1), pages 1-21, February.
    18. Wenyi Chen & Martijn Mes & Marco Schutten & Job Quint, 2019. "A Ride-Sharing Problem with Meeting Points and Return Restrictions," Transportation Science, INFORMS, vol. 53(2), pages 401-426, March.
    19. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    20. Horner, Hannah & Pazour, Jennifer & Mitchell, John E., 2021. "Optimizing driver menus under stochastic selection behavior for ridesharing and crowdsourced delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:102:y:2021:i:c:s0305048320307052. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.