A new polynomial-time algorithm for linear programming
Combinatorica
Exponential lower bounds for finding Brouwer fixed points
Journal of Complexity
On total functions, existence theorems and computational complexity
Theoretical Computer Science
Complexity theory of real functions
Complexity theory of real functions
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
On the complexity of price equilibria
Journal of Computer and System Sciences - STOC 2002
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
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
On algorithms for discrete and approximate brouwer fixed points
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics)
Issues in computational Vickrey auctions
International Journal of Electronic Commerce - Special issue: Intelligent agents for electronic commerce
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Approximating nash equilibria using small-support strategies
Proceedings of the 8th ACM conference on Electronic commerce
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
The approximation complexity of win-lose games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Games of fixed rank: a hierarchy of bimatrix games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A fractional model of the border gateway protocol (BGP)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the approximation and smoothed complexity of Leontief market equilibria
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
New algorithms for approximate Nash equilibria in bimatrix games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Market equilibria with hybrid linear-leontief utilities
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Polynomial algorithms for approximating nash equilibria of bimatrix games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A note on approximate nash equilibria
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Exchange market equilibria with leontief’s utility: freedom of pricing leads to rationality
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Locally 2-dimensional sperner problems complete for the polynomial parity argument classes
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the complexity of 2d discrete fixed point problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Communications of the ACM
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
Mixing time and stationary expected social welfare of logit dynamics
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
2-Player nash and nonsymmetric bargaining games: algorithms and structural properties
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
Rationality and Strongly Polynomial Solvability of Eisenberg-Gale Markets with Two Agents
SIAM Journal on Discrete Mathematics
Market equilibrium under separable, piecewise-linear, concave utilities
Journal of the ACM (JACM)
Complexity and economics: computational constraints may not matter empirically
ACM SIGecom Exchanges
A revealed preference approach to computational complexity in economics
Proceedings of the 12th ACM conference on Electronic commerce
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Automatizability and simple stochastic games
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Inapproximability of NP-complete variants of nash equilibrium
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
The complexity of nash equilibria in limit-average games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On the approximation performance of fictitious play in finite games
ESA'11 Proceedings of the 19th European conference on Algorithms
Complexity of rational and irrational Nash equilibria
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Metastability of logit dynamics for coordination games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Intrinsic robustness of the price of anarchy
Communications of the ACM
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lossy stochastic game abstraction with bounds
Proceedings of the 13th ACM Conference on Electronic Commerce
Cache me if you can: capacitated selfish replication games
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
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
The complexity of decision problems about nash equilibria in win-lose games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Approximate well-supported nash equilibria below two-thirds
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the communication complexity of approximate nash equilibria
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Ranking games that have competitiveness-based strategies
Theoretical Computer Science
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
The empirical implications of rank in Bimatrix games
Proceedings of the fourteenth ACM conference on Electronic commerce
On the verification and computation of strong nash equilibrium
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of non-monotone markets
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Full characterization of quantum correlated equilibria
Quantum Information & Computation
Game-theoretic question selection for tests
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
Complexity of Rational and Irrational Nash Equilibria
Theory of Computing Systems
| Hi-index | 0.04 |
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by Papadimitriou in 1991. Our result, building upon the work of Daskalakis et al. [2006a] on the complexity of four-player Nash equilibria, settles a long standing open problem in algorithmic game theory. It also serves as a starting point for a series of results concerning the complexity of two-player Nash equilibria. In particular, we prove the following theorems: —Bimatrix does not have a fully polynomial-time approximation scheme unless every problem in PPAD is solvable in polynomial time. —The smoothed complexity of the classic Lemke-Howson algorithm and, in fact, of any algorithm for Bimatrix is not polynomial unless every problem in PPAD is solvable in randomized polynomial time. Our results also have a complexity implication in mathematical economics: —Arrow-Debreu market equilibria are PPAD-hard to compute.