Log depth circuits for division and related problems
SIAM Journal on Computing
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Simple local search problems that are hard to solve
SIAM Journal on Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximate Local Search in Combinatorial Optimization
SIAM Journal on Computing
Computing Nash equilibria of action-graph games
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The computational complexity of nash equilibria in concisely represented games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
Information Processing Letters
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Equilibria in Anonymous Games
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Computing pure Nash equilibria in symmetric action graph games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Equilibria of Graphical Games with Symmetries
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Computing pure strategy nash equilibria in compact symmetric games
Proceedings of the 11th ACM conference on Electronic commerce
Ranking games that have competitiveness-based strategies
Proceedings of the 11th ACM conference on Electronic commerce
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
Neighbourhood structure in large games
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Equilibria problems on games: Complexity versus succinctness
Journal of Computer and System Sciences
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Dynamic restriction of choices: synthesis of societal rules
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Nash equilibrium for collective strategic reasoning
Expert Systems with Applications: An International Journal
Ranking games that have competitiveness-based strategies
Theoretical Computer Science
Hi-index | 0.00 |
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, is that players cannot, or need not, distinguish between the other players. We investigate the computational complexity of pure Nash equilibria in four classes of symmetric games obtained by considering two additional properties: identical payoff functions for all players and the ability to distinguish oneself from the other players. In contrast to other types of succinctly representable multi-player games, the pure equilibrium problem is tractable in all four classes when only a constant number of actions is available to each player. Identical payoff functions make the difference between TC^0-completeness and membership in AC^0, while a growing number of actions renders the equilibrium problem NP-hard for three of the classes and PLS-hard for the most restricted class for which the existence of a pure equilibrium is guaranteed. Our results also extend to larger classes of threshold symmetric games where players are unable to determine the exact number of players playing a certain action.