Convergence and approximation in potential games
- 1 June 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 438, 13-27
- https://doi.org/10.1016/j.tcs.2012.02.033
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Performances of One-Round Walks in Linear Congestion GamesLecture Notes in Computer Science, 2009
- Fast convergence to nearly optimal solutions in potential gamesPublished by Association for Computing Machinery (ACM) ,2008
- The Speed of Convergence in Congestion Games under Best-Response DynamicsLecture Notes in Computer Science, 2008
- Convergence and Approximation in Potential GamesLecture Notes in Computer Science, 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
- Correlation ClusteringMachine Learning, 2004
- The complexity of pure Nash equilibriaPublished by Association for Computing Machinery (ACM) ,2004
- Convergence Time to Nash EquilibriaLecture Notes in Computer Science, 2003