IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v120y2019icp147-171.html
   My bibliography  Save this article

Mechanism design for first-mile ridesharing based on personalized requirements part I: Theoretical analysis in generalized scenarios

Author

Listed:
  • Bian, Zheyong
  • Liu, Xiang

Abstract

Ridesharing is an effective transportation mode to provide first-mile accessibility to public transit and a low-cost, environment-friendly, and sustainable mobility service. This paper designs a mechanism for the first-mile ridesharing service. The mechanism accounts for passengers’ personalized requirements on different inconvenience attributes (e.g. the number of co-riders, extra in-vehicle travel time, and extra waiting time at the transit hub) of the service in determining the optimal vehicle-passenger matching and vehicle routing plan and customized pricing scheme. The proposed mechanism is proved to be individual rational, incentive compatible, and price non-negative. The three properties respectively indicate that passengers are willing to participate in the service, that honestly reporting personalized requirements is the optimal strategy, and that the service provider is guaranteed to receive revenue from the participants. A case study is proposed to interpret the mechanism and to demonstrate the generality of the personalized-requirement-based mechanism that can be adapted into different scenarios.

Suggested Citation

  • Bian, Zheyong & Liu, Xiang, 2019. "Mechanism design for first-mile ridesharing based on personalized requirements part I: Theoretical analysis in generalized scenarios," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 147-171.
  • Handle: RePEc:eee:transb:v:120:y:2019:i:c:p:147-171
    DOI: 10.1016/j.trb.2018.12.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517308044
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2018.12.009?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. Qian, Xinwu & Ukkusuri, Satish V., 2017. "Taxi market equilibrium with third-party hailing service," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 43-63.
    2. 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.
    3. Gonzales, Eric J., 2016. "Demand responsive transit systems with time-dependent demand: User equilibrium, system optimum, and management strategyAuthor-Name: Amirgholy, Mahyar," Transportation Research Part B: Methodological, Elsevier, vol. 92(PB), pages 234-252.
    4. Hurwicz,Leonid & Reiter,Stanley, 2008. "Designing Economic Mechanisms," Cambridge Books, Cambridge University Press, number 9780521724104.
    5. Myerson, Roger B, 1979. "Incentive Compatibility and the Bargaining Problem," Econometrica, Econometric Society, vol. 47(1), pages 61-73, January.
    6. Yang, Hai & Wong, S. C. & Wong, K. I., 2002. "Demand-supply equilibrium of taxi services in a network under competition and regulation," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 799-819, November.
    7. Frisk, M. & Göthe-Lundgren, M. & Jörnsten, K. & Rönnqvist, M., 2010. "Cost allocation in collaborative forest transportation," European Journal of Operational Research, Elsevier, vol. 205(2), pages 448-458, September.
    8. Krygsman, Stephan & Dijst, Martin & Arentze, Theo, 2004. "Multimodal public transport: an analysis of travel time elements and the interconnectivity ratio," Transport Policy, Elsevier, vol. 11(3), pages 265-275, July.
    9. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    10. Zou, Bo & Kafle, Nabin & Wolfson, Ouri & Lin, Jie (Jane), 2015. "A mechanism design based approach to solving parking slot assignment in the information era," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 631-653.
    11. Nisan,Noam & Roughgarden,Tim & Tardos,Eva & Vazirani,Vijay V. (ed.), 2007. "Algorithmic Game Theory," Cambridge Books, Cambridge University Press, number 9780521872829.
    12. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    13. Qian, Xinwu & Zhang, Wenbo & Ukkusuri, Satish V. & Yang, Chao, 2017. "Optimal assignment and incentive design in the taxi group ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 208-226.
    14. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    15. Shaheen, Susan PhD & Chan, Nelson, 2016. "Mobility and the Sharing Economy: Potential to Overcome First- and Last-Mile Public Transit Connections," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt8042k3d7, Institute of Transportation Studies, UC Berkeley.
    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. Roberto Baldacci & Vittorio Maniezzo & Aristide Mingozzi, 2004. "An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation," Operations Research, INFORMS, vol. 52(3), pages 422-439, June.
    18. Masoud, Neda & Lloret-Batlle, Roger & Jayakrishnan, R., 2017. "Using bilateral trading to increase ridership and user permanence in ridesharing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 102(C), pages 60-77.
    19. Chen, Yiwei & Wang, Hai, 2018. "Pricing for a Last-Mile Transportation System," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 57-69.
    20. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    21. Golledge, Reginald G. & Kwan, Mei-Po & Garling, Tommy, 1994. "Computational-Process Modelling of Household Travel Decisions Using a Geographical Information System," University of California Transportation Center, Working Papers qt4kk8w93s, University of California Transportation Center.
    22. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    23. 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)

    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. Yinying He & Csaba Csiszár, 2021. "Model for Crowdsourced Parcel Delivery Embedded into Mobility as a Service Based on Autonomous Electric Vehicles," Energies, MDPI, vol. 14(11), pages 1-24, May.
    3. 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.
    4. Sun, Xiaotong & Yin, Yafeng, 2021. "Decentralized game-theoretical approaches for behaviorally-stable and efficient vehicle platooning," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 45-69.
    5. Xi, Haoning & Liu, Wei & Waller, S. Travis & Hensher, David A. & Kilby, Philip & Rey, David, 2023. "Incentive-compatible mechanisms for online resource allocation in Mobility-as-a-Service systems," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 119-147.
    6. Weimin Ma & Jiakai Chen & Hua Ke, 2021. "Electric Vehicle Assignment Considering Users’ Waiting Time," Sustainability, MDPI, vol. 13(23), pages 1-14, December.
    7. Barua, Limon & Zou, Bo & Choobchian, Pooria, 2023. "Maximizing truck platooning participation with preferences," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    8. Hu, Shichun & Dessouky, Maged M. & Uhan, Nelson A. & Vayanos, Phebe, 2021. "Cost-sharing mechanism design for ride-sharing," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 410-434.
    9. Ding, Xiaoshu & Qi, Qi & Jian, Sisi & Yang, Hai, 2023. "Mechanism design for Mobility-as-a-Service platform considering travelers’ strategic behavior and multidimensional requirements," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 1-30.
    10. Iva Bojic & Dániel Kondor & Wei Tu & Ke Mai & Paolo Santi & Carlo Ratti, 2021. "Identifying the Potential for Partial Integration of Private and Public Transportation," Sustainability, MDPI, vol. 13(6), pages 1-16, March.
    11. Kumar, Pramesh & Khani, Alireza, 2022. "Planning of integrated mobility-on-demand and urban transit networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 499-521.
    12. Meijian Yang & Enjun Xia, 2021. "A Systematic Literature Review on Pricing Strategies in the Sharing Economy," Sustainability, MDPI, vol. 13(17), pages 1-28, August.
    13. 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.

    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. 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.
    2. 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.
    3. Ding, Xiaoshu & Qi, Qi & Jian, Sisi & Yang, Hai, 2023. "Mechanism design for Mobility-as-a-Service platform considering travelers’ strategic behavior and multidimensional requirements," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 1-30.
    4. 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.
    5. 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.
    6. Nourinejad, Mehdi & Ramezani, Mohsen, 2020. "Ride-Sourcing modeling and pricing in non-equilibrium two-sided markets," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 340-357.
    7. 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.
    8. Omer Faruk Aydin & Ilgin Gokasar & Onur Kalan, 2020. "Matching algorithm for improving ride-sharing by incorporating route splits and social factors," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-23, March.
    9. 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).
    10. Shao, Saijun & Xu, Su Xiu & Yang, Hai & Huang, George Q., 2020. "Parking reservation disturbances," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 83-97.
    11. Maskin, Eric & Sjostrom, Tomas, 2002. "Implementation theory," Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 5, pages 237-288 Elsevier.
    12. Bierbrauer, Felix & Netzer, Nick, 2016. "Mechanism design and intentions," Journal of Economic Theory, Elsevier, vol. 163(C), pages 557-603.
    13. Steven J. Brams & Todd R. Kaplan & D. Marc Kilgour, 2015. "A Simple Bargaining Mechanism that Elicits Truthful Reservation Prices," Group Decision and Negotiation, Springer, vol. 24(3), pages 401-413, May.
    14. Claude d'Aspremont & Jacques Crémer & Louis-André Gérard-Varet, 2003. "Correlation, independence, and Bayesian incentives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 281-310, October.
    15. Wang, Pengfei & Guan, Hongzhi & Liu, Peng, 2020. "Modeling and solving the optimal allocation-pricing of public parking resources problem in urban-scale network," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 74-98.
    16. Esther Gal-Or & Anindya Ghose, 2005. "The Economic Incentives for Sharing Security Information," Information Systems Research, INFORMS, vol. 16(2), pages 186-208, June.
    17. Ronald M. Harstad & Aleksandar Saša Pekeč, 2008. "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf," Interfaces, INFORMS, vol. 38(5), pages 367-380, October.
    18. 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.
    19. Loertscher, Simon & Mezzetti, Claudio, 2019. "The deficit on each trade in a Vickrey double auction is at least as large as the Walrasian price gap," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 101-106.
    20. Yukun Cheng & Xiaotie Deng & Dominik Scheder, 2022. "Recent studies of agent incentives in internet resource allocation and pricing," Annals of Operations Research, Springer, vol. 314(1), pages 49-76, July.

    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:transb:v:120:y:2019:i:c:p:147-171. 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/548/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.