论文标题
匹配机制，带有预期通行费的交通拥堵定价
A Matching Mechanism with Anticipatory Tolls for Congestion Pricing
论文作者
论文摘要
本文提出了一种匹配机制，用于将驾驶员分配到驾驶员对其他驾驶员施加的边际延迟造成损失的路线。简单的匹配机制源自Karp等人提出的在线二分匹配的排名算法。 [8]。在设计中预期的通行费是Dong等人提出的一项改编。 [5]。我们的研究证明，此处提出的匹配机制是帕累托用户最佳的，并且可以适应以最大程度地减少旅行的总社交成本的最佳网络结果。
This paper presents a matching mechanism for assigning drivers to routes where the drivers pay a toll for the marginal delay they impose on other drivers. The simple matching mechanism is derived from the RANKING algorithm for online bipartite matching proposed by Karp et al. [8]. The toll, which is anticipatory in design, is an adaption of one proposed by Dong et al. [5]. Our research proves that the matching mechanism proposed here is pareto user-optimal and can be adapted to give network optimal results for the minimizing total social cost of travel.
