Selfish Routing in Capacitated Networks
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 extensions of recent positive results on the efficiency of Nash equilibria in traffic networks. In contrast to prior work, we present results for networks with capacities and for latency functions that are nonconvex, nondifferentiable and even discontinuous. The inclusion of upper bounds on arc flows has early been recognized as an important means to provide a more accurate description of traffic flows. In this more general model, multiple Nash equilibria may exist and an arbitrary equilibrium does not need to be nearly efficient. Nonetheless, our main result shows that the best equilibrium is as efficient as in the model without capacities. Moreover, this holds true for broader classes of travel cost functions than considered hithert
|Date of creation:||01 Aug 2003|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://mitsloan.mit.edu/
More information through EDIRC
|Order Information:|| Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- A. de Palma & Y. Nesterov, 1997.
"Optimization formulations and static equilibrium in congested transportation networks,"
THEMA Working Papers
97-17, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- de PALMA, AndrÃ© & NESTEROV, Yurii, 1998. "Optimization formulations and static equilibrium in congested transportation networks," CORE Discussion Papers 1998061, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Larsson, Torbjörn & Patriksson, Michael, 1995. "An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 29(6), pages 433-455, December.
- Yang, Hai & Yagar, Sam, 1994. "Traffic assignment and traffic control in general freeway-arterial corridor systems," Transportation Research Part B: Methodological, Elsevier, vol. 28(6), pages 463-486, December.
- Gartner, Nathan H. & Gershwin, Stanley B. & Little, John D. C. & Ross, Paul, 1980. "Pilot study of computer-based urban traffic management," Transportation Research Part B: Methodological, Elsevier, vol. 14(1-2), pages 203-217.
- Larsson, Torbjörn & Patriksson, Michael, 1999. "Side constrained traffic equilibrium models-- analysis, computation and applications," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 233-264, May.
- Hearn, Donald W. & Ribera, Jaime, 1981. "Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 15(6), pages 437-442, December.
When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:3533. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann)
If references are entirely missing, you can add them using this form.