2000 character limit reached
Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing (2110.01152v2)
Published 4 Oct 2021 in cs.AI, econ.GN, and q-fin.EC
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.
- On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences, 114(3):462–467, 2017.
- The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4):1602–1623, 2008.
- Algorithms for trip-vehicle assignment in ride-sharing. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018, pages 3–9, 2018. URL https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16583.
- A muddle of models of motivation for using peer-to-peer economy systems. In Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems, pages 1085–1094. ACM, 2015.
- Introduction to linear optimization, volume 6. Athena Scientific Belmont, MA, 1997.
- The price of fairness. Operations research, 59(1):17–31, 2011.
- Online vehicle routing: The edge of optimization in large-scale applications. Operations Research, 67(1):143–162, 2019. 10.1287/opre.2018.1763. URL https://doi.org/10.1287/opre.2018.1763.
- Spatial pricing in ride-sharing networks. Operations Research, 67(3):744–769, 2019. 10.1287/opre.2018.1800. URL https://doi.org/10.1287/opre.2018.1800.
- Recommending fair payments for large-scale social ridesharing. In Proceedings of the 9th ACM Conference on Recommender Systems, pages 139–146. ACM, 2015.
- A new solution to the random assignment problem. Journal of Economic theory, 100(2):295–328, 2001.
- Randomized online matching in regular graphs. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 960–979, 2018. 10.1137/1.9781611975031.62. URL https://doi.org/10.1137/1.9781611975031.62.
- Jean-François Cordeau. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3):573–586, 2006.
- Vehicle routing. Handbooks in operations research and management science, 14:367–428, 2007.
- Ridesharing: The state-of-the-art and future directions. Transportation Research Part B: Methodological, 57:28–46, 2013.
- A survey of the stable marriage problem and its variants. In International Conference on Informatics Education and Research for Knowledge-Circulating Society, pages 131–136. IEEE, 2008.
- Opportunistic fair scheduling over multiple wireless channels. In IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies, pages 1106–1115. IEEE, 2003.
- Hard variants of stable marriage. Theoretical Computer Science, 276(1-2):261–279, 2002.
- Neda Masoud and R Jayakrishnan. A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system. Transportation Research Part B: Methodological, 106:218–236, 2017.
- Dynamic matching for real-time ride sharing. Stochastic Systems, 10(1):29–70, 2020.
- Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research, 37(6):1129–1138, 2010.
- Quantifying the benefits of vehicle pooling with shareability networks. Proceedings of the National Academy of Sciences, 111(37):13290–13294, 2014.
- Neural approximate dynamic programming for on-demand ride-pooling, 2019.
- An analysis of peer-to-peer networks with altruistic peers. Peer-to-Peer Networking and Applications, 2(2):109–127, 2009.
- Stable matching for dynamic ride-sharing systems. Transportation Science, 52(4):850–867, 2018. 10.1287/trsc.2017.0768. URL https://doi.org/10.1287/trsc.2017.0768.