Journal of the ACM (JACM)
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the NP-completeness of finding an optimal strategy in games with common payoffs
International Journal of Game Theory
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
A polynomial-time nash equilibrium algorithm for repeated games
Proceedings of the 4th ACM conference on Electronic commerce
The complexity of dynamic languages and dynamic optimization problems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Multi-agent influence diagrams for representing and solving games
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Computing approximate bayes-nash equilibria in tree-games of incomplete information
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Specialisation dynamics in federated web search
Proceedings of the 6th annual ACM international workshop on Web information and data management
Asymmetric multiagent reinforcement learning
Web Intelligence and Agent Systems
A polynomial-time Nash equilibrium algorithm for repeated games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Complexity of (iterated) dominance
Proceedings of the 6th ACM conference on Electronic commerce
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the computational complexity of Nash equilibria for (0, 1) bimatrix games
Information Processing Letters
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Computing sequential equilibria for two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of market equilibria with maximum social welfare
Information Processing Letters
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing the optimal strategy to commit to
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Playing games in many possible worlds
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The computational complexity of nash equilibria in concisely represented games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Query optimization in distributed networks of autonomous database systems
ACM Transactions on Database Systems (TODS)
Stochastic planning for weakly-coupled distributed agents
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A technique for reducing normal-form games to compute a Nash equilibrium
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Gradient descent for symmetric and asymmetric multiagent reinforcement learning
Web Intelligence and Agent Systems
Perspectives on multiagent learning
Artificial Intelligence
On the convergence of multicast games in directed networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Computing good nash equilibria in graphical games
Proceedings of the 8th ACM conference on Electronic commerce
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Computer science and game theory
Communications of the ACM - Designing games with a purpose
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
Selecting strategies using empirical game models: an experimental analysis of meta-strategies
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Note: On the complexity of deciding bimatrix games similarity
Theoretical Computer Science
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
Approximate Equilibria for Strategic Two Person Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Strategic Characterization of the Index of an Equilibrium
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Malicious Bayesian Congestion Games
Approximation and Online Algorithms
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Small Clique Detection and Approximate Nash Equilibria
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A generalized strategy eliminability criterion and computational methods for applying it
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
A continuation method for Nash equilibria in structured games
Journal of Artificial Intelligence Research
Complexity of pure equilibria in Bayesian games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A polynomial-time Nash equilibrium algorithm for repeated games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
On the computational complexity of Nash equilibria for (0,1) bimatrix games
Information Processing Letters
On the complexity of market equilibria with maximum social welfare
Information Processing Letters
The complexity of Nash equilibria in infinite multiplayer games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A sampling-based approach to computing equilibria in succinct extensive-form games
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Computing Nash equilibria gets harder: new results show hardness even for parameterized complexity
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Exploiting concavity in bimatrix games: new polynomially tractable subclasses
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
How do you like your equilibrium selection problems? hard, or very hard?
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
An expressive mechanism for auctions on the web
Proceedings of the 20th international conference on World wide web
Single parameter FPT-algorithms for non-trivial games
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Approximability of symmetric bimatrix games and related experiments
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Equilibria problems on games: Complexity versus succinctness
Journal of Computer and System Sciences
The complexity of nash equilibria in limit-average games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Complexity of rational and irrational Nash equilibria
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Enforcing truthful strategies in incentive compatible reputation mechanisms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
New results on the complexity of uniformly mixed nash equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Multicast transmissions in non-cooperative networks with a limited number of selfish moves
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Pure nash equilibria in games with a large number of actions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On nash equilibria for multicast transmissions in ad-hoc wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the complexity of uniformly mixed nash equilibria and related regular subgraph problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computing equilibria using interval constraints
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
On mutual concavity and strategically-zero-sum bimatrix games
Theoretical Computer Science
On envy-free pareto efficient pricing
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Towards tractable Boolean games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Well supported approximate equilibria in bimatrix games: a graph theoretic approach
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Invitation games and the price of stability
Proceedings of the 5th conference on Innovations in theoretical computer science
Complexity of Rational and Irrational Nash Equilibria
Theory of Computing Systems
Hi-index | 0.01 |
Noncooperative game theory provides a normative framework for analyzing strategic interactions. However, for the toolbox to be operational, the solutions it defines will have to be computed. In this paper, we provide a single reduction that 1) demonstrates NP-hardness of determining whether Nash equilibria with certain natural properties exist, and 2) demonstrates the NP-hardness of counting Nash equilibria (or connected sets of Nash equilibria). We also show that 3) determining whether a purestrategy Bayes-Nash equilibrium exists is NP-hard, and that 4) determining whether a pure-strategy Nash equilibrium exists in a stochastic (Markov) game is PSP ACE-hard even if the game is invisible (this remains NP-hard if the game is finite). All of our hardness results hold even if there are only two players and the game is symmetric.