  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.
