Convergence and Approximation in Potential Games
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 349-360
- https://doi.org/10.1007/11672142_28
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Sink Equilibria and ConvergencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The price of anarchy of finite congestion gamesPublished 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
- Market sharing games applied to content distribution in ad-hoc networksPublished by Association for Computing Machinery (ACM) ,2004
- Selfish Unsplittable FlowsLecture Notes in Computer Science, 2004
- Convergence Issues in Competitive GamesLecture Notes in Computer Science, 2004
- Convergence Time to Nash EquilibriaLecture Notes in Computer Science, 2003
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- How easy is local search?Journal of Computer and System Sciences, 1988