Inapproximability of Nash Equilibrium
Not on the map. Why?
Abstract (arXiv)
We prove that finding an ε-approximate Nash equilibrium is PPAD-complete for constant ε and a particularly simple class of games: polymatrix, degree 3 graphical games, in which each player has only two actions. As corollaries, we also prove similar inapproximability results for Bayesian Nash equilibrium in a two-player incomplete information game with a constant number of actions, for relative ε-Well Supported Nash Equilibrium in a two-player game, for market equilibrium in a non-monotone market, for the generalized circuit problem defined by Chen, Deng, and Teng [CDT'09], and for approximate competitive equilibrium from equal incomes with indivisible goods.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 May 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 3; 2024: 2; 2025: 3; 2026: 3.
14 papers.
Sort:
- 2022The Complexity of Markov Equilibrium in Stochastic Gamescited by 45
- 2023Fast swap regret minimization and applications to approximate correlated equilibriacited by 30
- 2023Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Gamescited by 9
- 2025Expected Variational Inequalitiescited by 5
- 2024The complexity of approximate (coarse) correlated equilibrium for incomplete information gamescited by 4
- 2023Smooth Nash Equilibria: Algorithms and Complexitycited by 3
- 2024Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learningcited by 3
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractabilitycited by 3
- 2026On the Computational Complexity of Performative Predictioncited by 2
- 2026Min-Max Optimization Requires Exponentially Many Queriescited by 1
- 2021A Variational Inequality Approach to Bayesian Regression Gamescited by 0
- 2021Approximating Nash Equilibrium in Random Graphical Gamescited by 0
- 2026Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria19 Sep 2026
- 2026Min-Max Optimization Requires Exponentially Many Queries13 May 2026
- 2026On the Computational Complexity of Performative Prediction28 Jan 2026
- 2025Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation17 Sep 2025
- 2025Expected Variational Inequalities25 Feb 2025
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractability25 Feb 2025
- 2024Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning22 Oct 2024
- 2024The complexity of approximate (coarse) correlated equilibrium for incomplete information games4 Jun 2024
- 2023Fast swap regret minimization and applications to approximate correlated equilibria30 Oct 2023
- 2023Smooth Nash Equilibria: Algorithms and Complexity21 Sep 2023
- 2023Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games22 Mar 2023
- 2022The Complexity of Markov Equilibrium in Stochastic Games8 Apr 2022
2 more
- 2022The Complexity of Markov Equilibrium in Stochastic Gamescited by 45
- 2023Fast swap regret minimization and applications to approximate correlated equilibriacited by 30
- 2023Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Gamescited by 9
- 2025Expected Variational Inequalitiescited by 5
- 2024The complexity of approximate (coarse) correlated equilibrium for incomplete information gamescited by 4
- 2023Smooth Nash Equilibria: Algorithms and Complexitycited by 3
- 2024Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learningcited by 3
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractabilitycited by 3
- 2026On the Computational Complexity of Performative Predictioncited by 2
- 2026Min-Max Optimization Requires Exponentially Many Queriescited by 1
- 2021A Variational Inequality Approach to Bayesian Regression Gamescited by 0
- 2021Approximating Nash Equilibrium in Random Graphical Gamescited by 0
12 most cited of 14 All 14 (JSON)
- 2026Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria19 Sep 2026
- 2026Min-Max Optimization Requires Exponentially Many Queries13 May 2026
- 2026On the Computational Complexity of Performative Prediction28 Jan 2026
- 2025Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation17 Sep 2025
- 2025Expected Variational Inequalities25 Feb 2025
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractability25 Feb 2025
- 2024Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning22 Oct 2024
- 2024The complexity of approximate (coarse) correlated equilibrium for incomplete information games4 Jun 2024
- 2023Fast swap regret minimization and applications to approximate correlated equilibria30 Oct 2023
- 2023Smooth Nash Equilibria: Algorithms and Complexity21 Sep 2023
- 2023Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games22 Mar 2023
- 2022The Complexity of Markov Equilibrium in Stochastic Games8 Apr 2022
12 newest of 14 All 14 (JSON)