STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fault tolerance in large games
Proceedings of the 9th ACM conference on Electronic commerce
Computing Equilibria in Large Games We Play
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
The Search for Equilibrium Concepts
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the Hardness and Existence of Quasi-Strict Equilibria
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the complexity of Nash equilibria of action-graph games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
An Efficient PTAS for Two-Strategy Anonymous Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Equilibria of Graphical Games with Symmetries
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On oblivious PTAS's for nash equilibrium
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the complexity of nash dynamics and sink equilibria
Proceedings of the 10th ACM conference on Electronic commerce
An optimal lower bound for anonymous scheduling mechanisms
Proceedings of the 10th ACM conference on Electronic commerce
Generalised fictitious play for a continuum of anonymous players
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Games with Congestion-Averse Utilities
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the complexity of pareto-optimal nash and strong equilibria
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Equilibria of graphical games with symmetries
Theoretical Computer Science
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Neighbourhood structure in large games
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Multiagent learning in large anonymous games
Journal of Artificial Intelligence Research
Dynamic restriction of choices: synthesis of societal rules
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Proceedings of the 13th ACM Conference on Electronic Commerce
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Mathematics of Operations Research
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentiate between other players. Our results pertain to such games with many players but few strategies. We show that any such game has an approximate pure Nash equilibrium, computable in polynomial time, with approximation {\rm O}(s^2 \lambda ), where s is the number of strategies and \lambda is the Lipschitz constant of the utilities. Finally, we show that there is a PTAS for finding an\in- approximate Nash equilibrium when the number of strategies is two.