Inapproximability of NP-complete variants of Nash equilibrium
From MaRDI portal
Recommendations
Cited in
(19)- Finding a Nash equilibrium in spatial games is an NP-complete problem
- Ex post Nash equilibrium in linear Bayesian games for decision making in multi-environments
- Inapproximability results for constrained approximate Nash equilibria
- Inapproximability results for approximate Nash equilibria
- How Hard Is It to Approximate the Best Nash Equilibrium?
- Inapproximability of NP-Complete Variants of Nash Equilibrium
- scientific article; zbMATH DE number 5942357 (Why is no real title available?)
- Small Clique Detection and Approximate Nash Equilibria
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- How hard is it to approximate the best Nash equilibrium?
- A nearly tight sum-of-squares lower bound for the planted clique problem
- Approximating the minmax value of three-player games within a constant is as hard as detecting planted cliques
- Computing approximate Nash equilibria in polymatrix games
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
- Approximating the existential theory of the reals
- Approximating the existential theory of the reals
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games
- Minimum stable cut and treewidth
- New complexity results about Nash equilibria
This page was built for publication: Inapproximability of NP-complete variants of Nash equilibrium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191570)
