IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2110.01152.html
   My bibliography  Save this paper

Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing

Author

Listed:
  • Hoon Oh
  • Yanhan Tang
  • Zong Zhang
  • Alexandre Jacquillat
  • Fei Fang

Abstract

Unlike commercial ridesharing, non-commercial peer-to-peer (P2P) ridesharing has been subject to limited research -- although it can promote viable solutions in non-urban communities. This paper focuses on the core problem in P2P ridesharing: the matching of riders and drivers. We elevate users' preferences as a first-order concern and introduce novel notions of fairness and stability in P2P ridesharing. We propose algorithms for efficient matching while considering user-centric factors, including users' preferred departure time, fairness, and stability. Results suggest that fair and stable solutions can be obtained in reasonable computational times and can improve baseline outcomes based on system-wide efficiency exclusively.

Suggested Citation

  • Hoon Oh & Yanhan Tang & Zong Zhang & Alexandre Jacquillat & Fei Fang, 2021. "Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing," Papers 2110.01152, arXiv.org, revised Jun 2023.
    • Handle: RePEc:arx:papers:2110.01152
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2110.01152
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kostas Bimpikis & Ozan Candogan & Daniela Saban, 2019. "Spatial Pricing in Ride-Sharing Networks," Operations Research, INFORMS, vol. 67(3), pages 744-769, May.
    2. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    3. Bimpikis, Kostas & Candogan, Ozan & Saban, Daniela, 2018. "Spatial Pricing in Ride-Sharing Networks," Research Papers repec:ecl:stabus:3482, Stanford University, Graduate School of Business.
    4. Dimitris Bertsimas & Vivek F. Farias & Nikolaos Trichakis, 2011. "The Price of Fairness," Operations Research, INFORMS, vol. 59(1), pages 17-31, February.
    5. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    6. Masoud, Neda & Jayakrishnan, R., 2017. "A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 218-236.
    Full references (including those not matched with items on IDEAS)

    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. Xingyuan Li & Jing Bai, 2021. "A Ridesharing Choice Behavioral Equilibrium Model with Users of Heterogeneous Values of Time," IJERPH, MDPI, vol. 18(3), pages 1-22, January.
    2. Bian, Zheyong & Liu, Xiang & Bai, Yun, 2020. "Mechanism design for on-demand first-mile ridesharing," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 77-117.
    3. 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.
    4. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    5. 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.
    6. Rui Yao & Shlomo Bekhor, 2021. "A Dynamic Tree Algorithm for Peer-to-Peer Ridesharing Matching," Networks and Spatial Economics, Springer, vol. 21(4), pages 801-837, December.
    7. Thomas L. Magnanti & Karthik Natarajan, 2018. "Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization," Interfaces, INFORMS, vol. 48(3), pages 204-216, June.
    8. Marta Boczoń & Alistair J. Wilson, 2023. "Goals, Constraints, and Transparently Fair Assignments: A Field Study of Randomization Design in the UEFA Champions League," Management Science, INFORMS, vol. 69(6), pages 3474-3491, June.
    9. Sepide Lotfi & Khaled Abdelghany, 2022. "Ride matching and vehicle routing for on-demand mobility services," Journal of Heuristics, Springer, vol. 28(3), pages 235-258, June.
    10. Tafreshian, Amirmahdi & Abdolmaleki, Mojtaba & Masoud, Neda & Wang, Huizhu, 2021. "Proactive shuttle dispatching in large-scale dynamic dial-a-ride systems," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 227-259.
    11. 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.
    12. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
    13. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    14. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
    15. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    16. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    17. Zhong, Yuanguang & Zillmann, Stefan & Zhang, Ruijie & Zhou, Yong-Wu & Xie, Wei, 2023. "Vehicle repositioning for a ride-sourcing network system providing differentiated services," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 221-243.
    18. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    19. Brandt, Felix & Saile, Christian & Stricker, Christian, 2022. "Strategyproof social choice when preferences and outcomes may contain ties," Journal of Economic Theory, Elsevier, vol. 202(C).
    20. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2110.01152. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.