2020/02/12 by Aguma, J Ceasar, Regan, Amelia C.
#Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.2002.05269
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.