Abstract
We consider routing problems where agents have preferences over pickup and delivery travel options. We look at the class of mechanisms that maximise social welfare. We study computing outcomes with such mechanisms. We also show that agents can manipulate such mechanisms. In response, we study computing pure Nash equilibria induced by such mechanisms. Finally, we analyse the price of anarchy for such mechanisms, which quantifies the welfare loss in an equilibrium.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
References
Afrati, F., Cosmadakis, S., Papadimitriou, C. H., Papageorgiou, G., & Papakostantinou, N. (1986). The complexity of the travelling repairman problem. RAIRO—Theoretical Informatics and Applications—Informatique Théorique et Applications, 20(1), 79–87. http://www.numdam.org/item/ITA_1986_20_1_79_0/
Aleksandrov, M. D. (2021). Fleet fairness and fleet efficiency in capacitated pickup and delivery problems. In Proceedings of the 32nd IEEE Intelligent Vehicles Symposium (IV21), Nagoya, Japan, July 11–17, 2021 (pp. 1156–1161). IEEE Xplore. https://doi.org/10.1109/IV48863.2021.9576002
Fredman, M., & Tarjan, R. (1984). Fibonacci heaps and their uses in improved network optimization algorithms. In 25th Annual Symposium on Foundations of Computer Science (pp. 338–346). https://doi.org/10.1109/SFCS.1984.715934
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman. https://doi.org/10.5555/574848
Gschwind, T., & Drexl, M. (2019). Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem. Transportation Science, 53, 480–491. https://doi.org/10.1287/trsc.2018.0837
Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In C. Meinel, & S. Tison (Eds.), Proceedings of 16th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science (Vol. 1563, pp. 404–413). Springer. https://doi.org/10.1007/3-540-49116-3_38
Ma, H., Fang, F., & Parkes, D. C. (2020). Spatio-temporal pricing for ridesharing platforms. SIGecom Exchange, 18(2), 53–57. https://doi.org/10.1145/3440968.3440975
Nash, J. (1950). The bargaining problem. Econometrica, 18(2), 155–162. https://doi.org/10.2307/1907266
Nucamendi, S., Cardona-Valdes, Y., & Angel-Bello Acosta, F. (2015). Minimizing customers’ waiting time in a vehicle routing problem with unit demands. Journal of Computer and Systems Sciences International, 54(6), 866–881. https://doi.org/10.1134/S1064230715040024
Paquette, J., Bellavance, F., Cordeau, J. F., & Laporte, G. (2012). Measuring quality of service in dial-a-ride operations: The case of a Canadian city. Transportation, 39(3), 539–564. https://doi.org/10.1007/s11116-011-9375-4
Rheingans-Yoo, D., Kominers, S. D., Ma, H., & Parkes, D. C. (2019). Ridesharing with driver location preferences. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, International Joint Conferences on Artificial Intelligence Organization (pp. 557–564). https://doi.org/10.24963/ijcai.2019/79
Vidal, T., Laporte, G., & Matl, P. (2020). A concise guide to existing and emerging vehicle routing problem variants. European Journal of Operational Research, 286(2), 401–416. https://doi.org/10.1016/j.ejor.2019.10.010
Acknowledgements
Martin Aleksandrov was supported by the DFG Individual Research Grant on “Fairness and Efficiency in Emerging Vehicle Routing Problems” (497791398).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Aleksandrov, M.D. (2023). Manipulating Waiting-Plus-Detour-Time Mechanisms for Pickup and Delivery Problems. In: Grothe, O., Nickel, S., Rebennack, S., Stein, O. (eds) Operations Research Proceedings 2022. OR 2022. Lecture Notes in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-031-24907-5_53
Download citation
DOI: https://doi.org/10.1007/978-3-031-24907-5_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-24906-8
Online ISBN: 978-3-031-24907-5
eBook Packages: Business and ManagementBusiness and Management (R0)