Convergence and approximation in potential games
Authors:
- George ChristodoulouGCGeorge Christodoulou
- Vahab S. MirrokniVMVahab S. Mirrokni
- Anastasios SidiropoulosASAnastasios Sidiropoulos
- 1 June 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 438, 13-27
Abstract
No abstract availableKeywords
This publication has 26 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 games2008
- The Speed of Convergence in Congestion Games under Best-Response Dynamics2008
- Convergence and Approximation in Potential Games2006
- The price of anarchy of finite congestion games2005
- The Price of Routing Unsplittable Flow2005
- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,2005
- Correlation ClusteringMachine Learning, 2004
- The complexity of pure Nash equilibria2004
- Convergence Time to Nash Equilibria2003