Abstract
We propose a fair-assignment algorithm between vehicles and passengers to mitigate the efficiency and fairness tradeoff for on-demand ride-hailing platforms. Ride-hailing platforms connect passengers and drivers in real time. While most studies focused on developing an optimally efficient assignment method for maximizing the profit of the platform, optimal efficiency may lead to profit inequality for drivers. Therefore, fair-assignment algorithms have begun to attract attention from artificial-intelligence researchers. While a fair-assignment algorithm based on max-min fairness, which is a representative concept of fairness, has been proposed, profit inequality among drivers still remains when assignments are made multiple times. To address such inequality, we develop a fair-assignment algorithm called the priority assignment algorithm PA(k) to give priority to drivers with low cumulative profit then generate an optimally efficient assignment for the remaining drivers and passengers. We also develop a method of dynamically determining the number of priorities at each assignment. We experimentally demonstrated that PA(k) outperforms the existing fair assignment algorithms in both efficiency and fairness in the case of excess supply by using a real-world dataset.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
https://www1.nyc.gov/site/tlc/about/tlc-trip-record-data.page.
References
Bertsimas, D., Farias, V.F., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17–31 (2011)
Chaudhari, H.A., Byers, J.W., Terzi, E.: Putting data in the driver’s seat: optimizing earnings for on-demand ride-hailing. In: Proceedings of the 11th ACM International Conference on Web Search and Data Mining, pp. 90–98 (2018)
Dickerson, J.P., Sankararaman, K.A., Sarpatwar, K.K., Srinivasan, A., Wu, K., Xu, P.: Online resource allocation with matching constraints. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS-2019), pp. 1681–1689 (2019)
Dickerson, J.P., Sankararaman, K.A., Srinivasan, A., Xu, P.: Allocation problems in ride-sharing platforms: online matching with offline reusable resources. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI-2018), pp. 1007–1014 (2018)
Lesmana, N.S., Zhang, X., Bei, X.: Balancing efficiency and fairness in on-demand ridesourcing. In: Advances in Neural Information Processing Systems 32, pp. 5309–5319 (2019)
Li, M., et al.: Efficient ridesharing order dispatching with mean field multi-agent reinforcement learning. In: Proceeding of the World Wide Web Conference 2019 (WWW-2019), pp. 983–994 (2019)
Nanda, V., Xu, P., Sankararaman, K.A., Dickerson, J.P., Srinivasan, A.: Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours. In: Proceedings of AAAI-2020, pp. 2210–2217 (2020)
Sühr, T., Biega, A.J., Zehlike, M., Gummadi, K.P., Chakraborty, A.: Two-sided fairness for repeated matchings in two-sided markets: 2A case study of a ride-hailing platform. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD-2019), pp. 3082–3092 (2019)
Wang, H., Bei, X.: Real-time driver-request assignment in ridesourcing. In: Proceedings of AAAI-2022 (2022)
Zhao, B., Xu, P., Shi, Y., Tong, Y., Zhou, Z., Zeng, Y.: Preference-aware task assignment in on-demand taxi dispatching: an online stable matching approach. In: Proceedings of AAAI-2019, pp. 2245–2252 (2019)
Zhou, M., et al.: Multi-agent reinforcement learning for order-dispatching via order-vehicle distribution matching. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM-2019), pp. 2645–2653 (2019)
Acknowledgments
This work was partially supported by JSPS KAKENHI Grant Numbers JP18H03301, JP17KK0008 and JP18H03299.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ota, M., Sakurai, Y., Guo, M., Noda, I. (2022). Mitigating Fairness and Efficiency Tradeoff in Vehicle-Dispatch Problems. In: Dignum, F., Mathieu, P., Corchado, J.M., De La Prieta, F. (eds) Advances in Practical Applications of Agents, Multi-Agent Systems, and Complex Systems Simulation. The PAAMS Collection. PAAMS 2022. Lecture Notes in Computer Science(), vol 13616. Springer, Cham. https://doi.org/10.1007/978-3-031-18192-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-031-18192-4_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-18191-7
Online ISBN: 978-3-031-18192-4
eBook Packages: Computer ScienceComputer Science (R0)