The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Computing good nash equilibria in graphical games
Proceedings of the 8th ACM conference on Electronic commerce
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
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The computation of approximate competitive equilibrium is PPAD-hard
Information Processing Letters
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
The Search for Equilibrium Concepts
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Approximate Equilibria for Strategic Two Person Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Approximate Nash Equilibria for Multi-player 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
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Market equilibria with hybrid linear-Leontief utilities
Theoretical Computer Science
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Theoretical Computer Science
On the complexity of nash dynamics and sink equilibria
Proceedings of the 10th ACM conference on Electronic commerce
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
On the complexity of 2D discrete fixed point problem
Theoretical Computer Science
New algorithms for approximate Nash equilibria in bimatrix games
Theoretical Computer Science
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Direction Preserving Zero Point Computing and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the approximation and smoothed complexity of Leontief market equilibria
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Algorithms for playing games with limited randomness
ESA'07 Proceedings of the 15th annual European conference on Algorithms
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
A PSPACE-complete Sperner triangle game
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
The cooperative game theory foundations of network bargaining games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
A direct reduction from k-player to 2-player approximate nash equilibrium
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
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximability of symmetric bimatrix games and related experiments
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Solving Stackelberg games with uncertain observability
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Approximate nash equilibria in bimatrix games
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
An interior-point path-following algorithm for computing a Leontief economy equilibrium
Computational Optimization and Applications
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
Convergence method, properties and computational complexity for Lyapunov games
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Making economic theory operational
WINE'06 Proceedings of the Second 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
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
On mutual concavity and strategically-zero-sum bimatrix games
Theoretical Computer Science
The complexity of approximate nash equilibrium in congestion games with negative delays
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The Computational Complexity of Nash Equilibria in Concisely Represented Games
ACM Transactions on Computation Theory (TOCT)
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
New results on the verification of Nash refinements for extensive-form 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
Probabilistic techniques in algorithmic game theory
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the Complexity of Approximating a Nash Equilibrium
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Differential evolution as a new method of computing nash equilibria
Transactions on Computational Collective Intelligence IX
The truth behind the myth of the folk theorem
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.01 |
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria and in the smoothed analysis of algorithms. --We show that no algorithm with complexity poly(n, \frac{1} { \in } ) can compute an \in-approximate Nash equilibrium in a two-player game, in which each player has n pure strategies, unless PPAD \subseteqP. In other words, the problem of computing a Nash equilibrium in a twoplayer game does not have a fully polynomial-time approximation scheme unless PPAD \subseteqP. --We prove that no algorithm for computing a Nash equilibrium in a two-player game can have smoothed complexity poly(n, \frac{1} {\sigma } ) under input perturbation of magnitude s, unless PPAD \subseteq RP. In particular, the smoothed complexity of the classic Lemke-Howson algorithm is not polynomial unless PPAD \subseteqRP. Instrumental to our proof, we introduce a new discrete fixed-point problem on a high-dimensional hypergrid with constant side-length, and show that it can host the embedding of the proof structure of any PPAD problem. We prove a key geometric lemma for finding a discrete fixed-point, a new concept defined on n + 1 vertices of a unit hypercube. This lemma enables us to overcome the curse of dimensionality in reasoning about fixed-points in high dimensions.