Bounding the inefficiency of equilibria in nonatomic congestion games
Top Cited Papers
- 1 May 2004
- journal article
- Published by Elsevier in Games and Economic Behavior
- Vol. 47 (2) , 389-403
- https://doi.org/10.1016/j.geb.2003.06.004
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demandsOperations Research Letters, 2003
- Selfish Routing in Capacitated NetworksSSRN Electronic Journal, 2003
- How bad is selfish routing?Journal of the ACM, 2002
- Anonymous Games with Binary ActionsGames and Economic Behavior, 1999
- Congestion Models of CompetitionThe American Naturalist, 1996
- Potential GamesGames and Economic Behavior, 1996
- A direct proof of the existence of pure strategy equilibria in games with a continuum of playersEconomic Theory, 1992
- On a theorem of SchmeidlerJournal of Mathematical Economics, 1984
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- The network equilibrium problem in integersNetworks, 1973