On the Performance of Approximate Equilibria in Congestion Games
- 15 September 2010
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 61 (1), 116-140
- https://doi.org/10.1007/s00453-010-9449-2
Abstract
No abstract availableKeywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Convergence to approximate Nash equilibria in congestion gamesGames and Economic Behavior, 2011
- On the Value of Coordination in Network DesignSIAM Journal on Computing, 2009
- Network design with weighted playersPublished by Association for Computing Machinery (ACM) ,2006
- Exact Price of Anarchy for Polynomial Congestion GamesLecture Notes in Computer Science, 2006
- Tight Bounds for Selfish and Greedy Load BalancingLecture Notes in Computer Science, 2006
- Settling the Complexity of Two-Player Nash EquilibriumPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- The price of anarchy of finite congestion gamesPublished by Association for Computing Machinery (ACM) ,2005
- The Price of Routing Unsplittable FlowPublished by Association for Computing Machinery (ACM) ,2005
- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,Lecture Notes in Computer Science, 2005
- The Price of Stability for Network Design with Fair Cost AllocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004