A note on approximate Nash equilibria
From MaRDI portal
Recommendations
Cites work
- A note on approximate Nash equilibria
- An optimization approach for approximate Nash equilibria
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
- scientific article; zbMATH DE number 3630786 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- New algorithms for approximate Nash equilibria in bimatrix games
- On oblivious PTAS's for nash equilibrium
- On sparse approximations to randomized strategies and convex combinations
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- Reducibility among equilibrium problems
- Settling the complexity of computing two-player Nash equilibria
- Simple strategies for large zero-sum games with applications to complexity theory
- The Approximation of Fixed Points of a Continuous Mapping
- The complexity of computing a Nash equilibrium
Cited in
(42)- A note on approximate Nash equilibria
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- New algorithms for approximate Nash equilibria in bimatrix games
- Inapproximability results for constrained approximate Nash equilibria
- An early paper on the refinement of Nash equilibrium
- Lipschitz continuity and approximate equilibria
- An algorithm for finding approximate Nash equilibria in bimatrix games
- Approximate solutions and Tikhonov well-posedness for Nash equilibria
- Lipschitz continuity and approximate equilibria
- Convergence method, properties and computational complexity for Lyapunov games
- The approximation complexity of win-lose games
- Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem
- Distributed Methods for Computing Approximate Equilibria
- Inapproximability results for approximate Nash equilibria
- Computing approximate Nash equilibria in general network revenue management games
- How Hard Is It to Approximate the Best Nash Equilibrium?
- Inapproximability of NP-Complete Variants of Nash Equilibrium
- 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
- Domination in 3-tournaments
- A glimpse at Paul G. Spirakis
- Approximative Nash-equilibria in network games
- Small Clique Detection and Approximate Nash Equilibria
- Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
- Recent development in computational complexity characterization of Nash equilibrium
- Nash equilibria: complexity, symmetries, and approximation
- Incentive-compatible learning of reserve prices for repeated auctions
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Computing approximate Nash equilibria in polymatrix games
- Tight SoS-degree bounds for approximate Nash equilibria
- Approximate Nash Equilibria for Multi-player Games
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
- A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
- Evolution of Mixed Strategies in Monotone Games
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- On the performance of approximate equilibria in congestion games
- Distributed methods for computing approximate equilibria
- A polynomial-time algorithm for 1/3-approximate Nash equilibria in bimatrix games
- Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time
- Approximations of Nash equilibria
- Well supported approximate equilibria in bimatrix games
This page was built for publication: A note on approximate Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014628)
