Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the computational complexity of Nash equilibria for (0,1) bimatrix games
Information Processing Letters
Perspectives on multiagent learning
Artificial Intelligence
Efficient computation of nash equilibria for very sparse win-lose bimatrix games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Factoring games to isolate strategic interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
Artificial Intelligence
Approximate Equilibria for Strategic Two Person Games
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
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
On strictly competitive multi-player games
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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
On the equilibria of alternating move games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Computing exact and approximate Nash equilibria in 2-player games
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Algorithms for closed under rational behavior (CURB) sets
Journal of Artificial Intelligence Research
On nash-equilibria of approximation-stable games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Practical and efficient approximations of nash equilibria for win-lose games based on graph spectra
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Single parameter FPT-algorithms for non-trivial games
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Complexity of rational and irrational Nash equilibria
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Making economic theory operational
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On the complexity of approximating a Nash equilibrium
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Parameterized two-player nash equilibrium
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Lossy stochastic game abstraction with bounds
Proceedings of the 13th ACM Conference on Electronic Commerce
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The complexity of decision problems about nash equilibria in win-lose games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the Complexity of Approximating a Nash Equilibrium
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Complexity of Rational and Irrational Nash Equilibria
Theory of Computing Systems
| Hi-index | 0.00 |
The efficient computation of Nash equilibria is one of the most formidable challenges in computational complexity today. The problem remains open for two-player games. We show that the complexity of two-player Nash equilibria is unchanged when all outcomes are restricted to be 0 or 1. That is, win-or-lose games are as complex as the general case for two-player games.