On the Complexity of Approximating a Nash Equilibrium

Cited In (30)

Title not available (Why is that?)
Title not available (Why is that?)
Approximating Wardrop Equilibria with Finitely Many Agents
Title not available (Why is that?)
Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
The Computational Complexity of Nash Equilibria in Concisely Represented Games
Learning Stationary Nash Equilibrium Policies in \(n\)-Player Stochastic Games with Independent Chains
Query complexity of approximate nash equilibria
Nash equilibria: complexity, symmetries, and approximation
Semidefinite Programming and Nash Equilibria in Bimatrix Games
Title not available (Why is that?)
The complexity of computing a Nash equilibrium
The Complexity of Nash Equilibria in Limit-Average Games
Approximations of Nash equilibria
Title not available (Why is that?)
On oblivious PTAS's for nash equilibrium
Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem
Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games
Computing approximate Nash equilibria in polymatrix games
Approximating Nash Equilibria in Tree Polymatrix Games
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Computing Nash equilibria by iterated polymatrix approximation
The Computation of Approximate Generalized Feedback Nash Equilibria
Inapproximability of NP-Complete Variants of Nash Equilibrium
On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium
Inapproximability of Nash Equilibrium
On the Complexity of Nash Equilibria and Other Fixed Points
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Equilibrium paths in discounted supergames
On the difficulty of approximately maximizing agreements.

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)