arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.01152cs.AIecon.GNq-fin.EC
收藏

非商业点对点拼车中的效率、公平性与稳定性

Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing

Carnegie Mellon University(卡内基梅隆大学);Massachusetts Institute of Technology(麻省理工学院)

Hoon Oh, Yanhan Tang, Zong Zhang, Alexandre Jacquillat, Fei Fang

AI总结:

针对非商业P2P拼车中乘客与司机匹配的核心问题,本文引入公平性与稳定性的新概念,提出考虑用户偏好出发时间的高效匹配算法,在合理计算时间内获得公平稳定解,优于仅追求系统效率的基线。

摘要:

与商业拼车不同,非商业点对点(P2P)拼车受到的研究有限——尽管它可以在非城市社区中促进可行的解决方案。本文聚焦于P2P拼车中的核心问题:乘客与司机的匹配。我们将用户的偏好提升为首要关注点,并引入了P2P拼车中公平性与稳定性的新颖概念。我们提出了在考虑用户中心因素(包括用户偏好的出发时间、公平性和稳定性)的同时实现高效匹配的算法。结果表明,公平且稳定的解决方案可以在合理的计算时间内获得,并且可以改善仅基于系统范围效率的基线结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑