Efficiency and Fairness of System-Optimal Routing With User Constraints
Andreas S. Schulz
Massachusetts Institute of Technology (MIT) - Sloan School of Management
Nicolas E. Stier-Moses
Facebook; Universidad Torcuato Di Tella - School of Business
Networks, Vol. 48, No. 4, pp. 223-234, 2006
We study the route-guidance system proposed by Jahn, Möhring, Schulz, and Stier-Moses [Operations Research 53 (2005), 600-616] from a theoretical perspective. As system-optimal guidance is known to be problematic, this approach computes a traffic pattern that minimizes the total travel time subject to user constraints. These constraints are designed to ensure that routes suggested to users are not much longer than shortest paths for the prevailing network conditions. To calibrate the system, a certain measure - called normal length - must be selected.We show that when this length is defined as the travel time at equilibrium, the resulting traffic assignment is provably efficient and close to fair. To measure efficiency, we compare the output to the best solution without guidance and to user equilibria. To measure unfairness, we compare travel times of different users, and show that they do not differ too much. Inefficient or unfair traffic assignments cause users to travel too long or discourage people from accepting the system; either consequence would jeopardize the potential impact of a route-guidance system.
Keywords: Selfish Routing, Price of Anarchy, Computational Game Theory, Multicommodity Flows, Route Guidance, Traffic Assignment
Date posted: August 17, 2004
© 2015 Social Science Electronic Publishing, Inc. All Rights Reserved.
This page was processed by apollo5 in 0.265 seconds