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