IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v203y2026ics0191261525002024.html

One-to-many stable matching for integrating ridesharing and public transit on a Mobility-as-a-Service platform

Author

Listed:
  • Wu, Yating
  • Lai, Minghui
  • Wang, Yuan

Abstract

Motivated by the practices of SocialCar project, we study the integration of one-to-many peer-to-peer ridesharing and public transit for a Mobility-as-a-Service (MaaS) platform in the morning commute setting. Drivers and riders can be flexibly matched through either a first-mile or last-mile connection but not both simultaneously. However, MaaS is essentially a decentralized user-centric system, which is challenging to operate since both service providers and travelers are self-interested. We adopt the concept of two-sided stable matching and formulate the decentralized planning problem as an integer program that typically includes an extremely large number of matches and complex stability constraints. The problem is further complicated by the possible nonexistence of a one-to-many stable matching. We propose two new algorithmic frameworks based on column-and-row-generation methods to efficiently check the existence of stable matching or determine an ϵ-stable matching as a relaxed solution for practical application. We test our algorithms with a real-world case study and show that our algorithms are computationally efficient and can generate a small value of ϵ for relaxed stability. Extensive computational experiments also reveal various new managerial insights into match selections, users’ detours and utilities, stability deviations, public transit utilization, the effects of pricing schemes, and the significance of stability.

Suggested Citation

  • Wu, Yating & Lai, Minghui & Wang, Yuan, 2026. "One-to-many stable matching for integrating ridesharing and public transit on a Mobility-as-a-Service platform," Transportation Research Part B: Methodological, Elsevier, vol. 203(C).
    • Handle: RePEc:eee:transb:v:203:y:2026:i:c:s0191261525002024
    DOI: 10.1016/j.trb.2025.103353
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261525002024
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2025.103353?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Peraphan Jittrapirom & Valeria Caiati & Anna-Maria Feneri & Shima Ebrahimigharehbaghi & María J. Alonso González & Jishnu Narayan, 2017. "Mobility as a Service: A Critical Review of Definitions, Assessments of Schemes, and Key Challenges," Urban Planning, Cogitatio Press, vol. 2(2), pages 13-25.
    2. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    3. Hai Nguyen & Thành Nguyen & Alexander Teytelboym, 2021. "Stability in Matching Markets with Complex Constraints," Management Science, INFORMS, vol. 67(12), pages 7438-7454, December.
    4. Wright, Steve & Nelson, John D. & Cottrill, Caitlin D, 2020. "MaaS for the suburban market: Incorporating carpooling in the mix," Transportation Research Part A: Policy and Practice, Elsevier, vol. 131(C), pages 206-218.
    5. Tang, Justin Hayse Chiwing G. & Liu, Junbei & Chen, Anthony & Wang, Bobin & Zhuge, Chengxiang & Yang, Xiong, 2025. "Exploring the potential adoption of Mobility-as-a-Service in Beijing: A spatial agent-based model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 194(C).
    6. Liu, Bingqing & Chow, Joseph Y． J．, 2024. "On-demand mobility-as-a-Service platform assignment games with guaranteed stable outcomes," Transportation Research Part B: Methodological, Elsevier, vol. 188(C).
    7. 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).
    8. Yao, Rui & Zhang, Kenan, 2024. "Design an intermediary mobility-as-a-service (MaaS) platform using many-to-many stable matching framework," Transportation Research Part B: Methodological, Elsevier, vol. 189(C).
    9. Akshay Vij & Stefanie Dühr, 2022. "The commercial viability of Mobility-as-a-Service (MaaS): what’s in it for existing transport operators, and why should governments intervene?," Transport Reviews, Taylor & Francis Journals, vol. 42(5), pages 695-716, September.
    10. Lucas Agussurja & Shih-Fen Cheng & Hoong Chuin Lau, 2019. "A State Aggregation Approach for Stochastic Multiperiod Last-Mile Ride-Sharing Problems," Service Science, INFORMS, vol. 53(1), pages 148-166, February.
    11. Fırat, M. & Briskorn, D. & Laugier, A., 2016. "A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills," European Journal of Operational Research, Elsevier, vol. 251(2), pages 676-685.
    12. Pantelidis, Theodoros P. & Chow, Joseph Y.J. & Rasulkhani, Saeid, 2020. "A many-to-many assignment game and stable outcome algorithm to evaluate collaborative mobility-as-a-service platforms," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 79-100.
    13. Theodoros P. Pantelidis & Joseph Y. J. Chow & Saeid Rasulkhani, 2019. "A many-to-many assignment game and stable outcome algorithm to evaluate collaborative Mobility-as-a-Service platforms," Papers 1911.04435, arXiv.org, revised Jun 2020.
    14. Molenbruch, Yves & Braekers, Kris & Hirsch, Patrick & Oberscheider, Marco, 2021. "Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm," European Journal of Operational Research, Elsevier, vol. 290(1), pages 81-98.
    15. 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.
    16. 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.
    17. Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
    18. Ruibin Bai & Jiawei Li & Jason A D Atkin & Graham Kendall, 2014. "A novel approach to independent taxi scheduling problem based on stable matching," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(10), pages 1501-1510, October.
    19. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    20. Lu, Wei & Quadrifoglio, Luca, 2019. "Fair cost allocation for ridesharing services – modeling, mathematical programming and an algorithm to find the nucleolus," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 41-55.
    21. Pitchaya Wiratchotisatian & Hoda Atef Yekta & Andrew C. Trapp, 2022. "Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3325-3343, November.
    22. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    23. Rasulkhani, Saeid & Chow, Joseph Y.J., 2019. "Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game," Transportation Research Part B: Methodological, Elsevier, vol. 124(C), pages 60-81.
    24. Chao Huang & Qianfeng Tang & Ziwei Wang, 2017. "Epsilon-stability in school choice," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 277-286, August.
    25. Peraphan Jittrapirom & Valeria Caiati & Anna-Maria Feneri & Shima Ebrahimigharehbaghi & María J. Alonso González & Jishnu Narayan, 2017. "Mobility as a Service: A Critical Review of Definitions, Assessments of Schemes, and Key Challenges," Urban Planning, Cogitatio Press, vol. 2(2), pages 13-25.
    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. Yao, Rui & Zhang, Kenan, 2024. "Design an intermediary mobility-as-a-service (MaaS) platform using many-to-many stable matching framework," Transportation Research Part B: Methodological, Elsevier, vol. 189(C).
    2. Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
    3. 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.
    4. van den Berg, Vincent A.C. & Meurs, Henk & Verhoef, Erik T., 2022. "Business models for Mobility as an Service (MaaS)," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 203-229.
    5. Luo, Chenghong & Pérez-Castrillo, David & Sun, Chaoran, 2024. "The equilibrium-value convergence for the multiple-partners game," Journal of Economic Theory, Elsevier, vol. 220(C).
    6. Wang, Yineng & Lin, Xi & He, Fang & Li, Meng, 2022. "Designing transit-oriented multi-modal transportation systems considering travelers’ choices," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 292-327.
    7. Tang, Justin Hayse Chiwing G. & Liu, Junbei & Chen, Anthony & Wang, Bobin & Zhuge, Chengxiang & Yang, Xiong, 2025. "Exploring the potential adoption of Mobility-as-a-Service in Beijing: A spatial agent-based model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 194(C).
    8. Fielbaum, Andres & Kucharski, Rafał & Cats, Oded & Alonso-Mora, Javier, 2022. "How to split the costs and charge the travellers sharing a ride? aligning system’s optimum with users’ equilibrium," European Journal of Operational Research, Elsevier, vol. 301(3), pages 956-973.
    9. Vincent A.C. van den Berg & Henk Meurs & Erik T. Verhoef, 2022. "Business models for Mobility as an Service," Tinbergen Institute Discussion Papers 22-002/VIII, Tinbergen Institute.
    10. Zhang, Tong & Li, Dawei & Huang, Hongfei & Chen, Xianlong & Chen, Zhuo, 2026. "Optimizing platform subsidy strategies in the MaaS era: Employing a mixed equilibrium dynamic traffic assignment framework with route choice rights game," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 206(C).
    11. Huang, Wentao & Jian, Sisi & Rey, David, 2024. "Non-additive network pricing with non-cooperative mobility service providers," European Journal of Operational Research, Elsevier, vol. 318(3), pages 802-824.
    12. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    13. Li, Ruijie & Liu, Yang & Liu, Xiaobo & Nie, Yu (Marco), 2024. "Allocation problem in cross-platform ride-hail integration," Transportation Research Part B: Methodological, Elsevier, vol. 188(C).
    14. 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.
    15. Rui Yao & Xinyu Ma & Kenan Zhang, 2026. "Mobility-as-a-service (MaaS) system as a multi-leader-multi-follower game: A single-level variational inequality (VI) formulation," Papers 2601.19880, arXiv.org.
    16. Pavlos Eirinakis & Dimitrios Magos & Ioannis Mourtos & Panayiotis Miliotis, 2012. "Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 245-259, May.
    17. Liu, Qi & Chow, Joseph Y.J., 2022. "Efficient and stable data-sharing in a public transit oligopoly as a coopetitive game," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 64-87.
    18. Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.
    19. de Palma, André & Stokkink, Patrick & Geroliminis, Nikolas, 2022. "Influence of dynamic congestion with scheduling preferences on carpooling matching with heterogeneous users," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 479-498.
    20. Chao Huang, 2021. "Unidirectional substitutes and complements," Papers 2108.12572, arXiv.org.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:transb:v:203:y:2026:i:c:s0191261525002024. 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.