On the complexity of approximating a Nash equilibrium
From MaRDI portal
Recommendations
Cited in
(41)- On the complexity of succinct zero-sum games
- On the difficulty of approximately maximizing agreements.
- Equilibrium paths in discounted supergames
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
- Can almost everybody be almost happy?
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- The complexity of computing a Nash equilibrium
- The approximation complexity of win-lose games
- Inapproximability of Nash equilibrium
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- scientific article; zbMATH DE number 6612107 (Why is no real title available?)
- On the Complexity of Nash Equilibria and Other Fixed Points
- Inapproximability of NP-Complete Variants of Nash Equilibrium
- The Complexity of Nash Equilibria in Limit-Average Games
- On Nash-equilibria of approximation-stable games
- A direct reduction from k-player to 2-player approximate Nash equilibrium
- Approximating Nash equilibria in tree polymatrix games
- Settling the complexity of computing two-player Nash equilibria
- Approximating Wardrop Equilibria with Finitely Many Agents
- scientific article; zbMATH DE number 5722763 (Why is no real title available?)
- Constant rank two-player games are PPAD-hard
- Inapproximability of Nash equilibrium
- Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
- Nash equilibria: complexity, symmetries, and approximation
- scientific article; zbMATH DE number 6866347 (Why is no real title available?)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- Solving zero-sum games using best-response oracles with applications to search games
- Computing approximate Nash equilibria in polymatrix games
- On oblivious PTAS's for nash equilibrium
- Query complexity of approximate nash equilibria
- Approximating the best Nash equilibrium in \(n^{o(\log n)}\)-time breaks the exponential time hypothesis
- scientific article; zbMATH DE number 6783488 (Why is no real title available?)
- The Computation of Approximate Generalized Feedback Nash Equilibria
- Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chains
- Algorithms and complexity for computing Nash equilibria in adversarial team games
- Smooth Nash equilibria: algorithms and complexity
- Pure-circuit: tight inapproximability for PPAD
- Computing Nash equilibria by iterated polymatrix approximation
- Approximations of Nash equilibria
This page was built for publication: On the complexity of approximating a Nash equilibrium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933653)
