The computational complexity of nash equilibria in concisely represented games (original) (raw)
Related papers
The complexity of computing a Nash equilibrium
Communications of the ACM, 2009
Settling the complexity of computing two-player Nash equilibria
Journal of The ACM, 2009
On the Complexity of Nash Equilibria of Action-Graph Games
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Equilibria problems on games: Complexity versus succinctness
Journal of Computer and System Sciences, 2011
Settling the Complexity of Two-Player Nash Equilibrium
2006
Pure Nash equilibria: complete characterization of hard and easy graphical games
2010
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
Information Processing Letters, 2006
Representation and Complexity in Boolean Games
Lecture Notes in Computer Science, 2004
Computing nash equilibria gets harder: New results show hardness even for parameterized complexity
2009
The complexity of Nash equilibria
2008
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science, 2009
On the complexity of problems on simple games
Maria Serna, Martin Olsen, Xavier Molinero
RAIRO - Operations Research, 2011
Pure Nash equilibria: hard and easy games
2003
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences, 2009
Nash and correlated equilibria: Some complexity considerations
Games and Economic Behavior, 1989
Constrained pure Nash equilibria in graphical games
2004
The Complexity of Games on Highly Regular Graphs
Lecture Notes in Computer Science, 2005
On the Complexity of Pareto-Optimal Nash and Strong Equilibria
Theory of Computing Systems, 2013
On the computability of Nash equilibria
Journal of Economic Dynamics and Control, 1997
New results on the complexity of uniformly mixed Nash equilibria
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2005
Complexity of pure equilibria in Bayesian games
International Joint Conference on Artificial Intelligence, 2007
Computing Nash Equilibria: Approximation and Smoothed Complexity
… 2006. FOCS'06. 47th Annual IEEE …, 2006
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge - TARK '03, 2003
Pure Nash Equilibria in Games with a Large Number of Actions
Lecture Notes in Computer Science, 2005
On the complexity of compact coalitional games
2009
The Complexity of Testing Properties of Simple Games
ArXiv, 2008
COMPUTING PURE STRATEGY NASH EQUILIBRIA IN COMPACT, SYMMETRIC GAMES WITH A FIXED NUMBER OF ACTIONS
Kevin Leyton-brown, Christopher Ryan, Albert Jiang
2000
Complexity in Cooperative Game Theory
On the Complexity of Computing Values of Restricted Games
International Journal of Foundations of Computer Science, 2002
Computational Aspects of Equilibria in Discrete Preference Games
2019
Graphical Models for Game Theory
2001