The price of anarchy of affine congestion games with similar strategies
- 15 October 2019
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 806, 641-654
- https://doi.org/10.1016/j.tcs.2019.10.012
Abstract
No abstract availableKeywords
Funding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca
This publication has 32 references indexed in Scilit:
- Decentralized utilitarian mechanisms for scheduling gamesGames and Economic Behavior, 2015
- The Price of Routing Unsplittable FlowSIAM Journal on Computing, 2013
- Convergence and approximation in potential gamesTheoretical Computer Science, 2012
- Taxes for linear atomic congestion gamesACM Transactions on Algorithms, 2010
- On the Performance of Approximate Equilibria in Congestion GamesAlgorithmica, 2010
- A new model for selfish routingTheoretical Computer Science, 2008
- Stackelberg Strategies for Selfish Routing in General Multicommodity NetworksAlgorithmica, 2007
- Tight bounds for worst-case equilibriaACM Transactions on Algorithms, 2007
- How bad is selfish routing?Journal of the ACM, 2002
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973