A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
According to Wardrop's first principle, agents in a congested network choose their routes selfishly, a behavior that is captured by the Nash equilibrium of the underlying noncooperative game. A Nash equilibrium does not optimize any global criterion per se, and so there is no apparent reason why it should be close to a solution of minimal total travel time, i.e. the system optimum. In this paper, we offer positive results on the efficiency of Nash equilibria in traffic networks. In contrast todoi:10.1287/moor.1040.0098 fatcat:wryyoykx6rao3khy3smjy35ng4