Polynomial algorithms for approximating Nash equilibria of bimatrix games
From MaRDI portal
Recommendations
- New algorithms for approximate Nash equilibria in bimatrix games
- An optimization approach for approximate Nash equilibria
- Computing exact and approximate Nash equilibria in 2-player games
- Approximate well-supported Nash equilibria in symmetric bimatrix games
- Computing approximate Nash equilibria in polymatrix games
Cites work
- A note on approximate Nash equilibria
- Bimatrix Equilibrium Points and Mathematical Programming
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
- Equilibrium Points of Bimatrix Games
- New algorithms for approximate Nash equilibria in bimatrix games
- Non-cooperative games
- On sparse approximations to randomized strategies and convex combinations
- On the complexity of the parity argument and other inefficient proofs of existence
- The complexity of computing a Nash equilibrium
Cited in
(34)- A note on approximate Nash equilibria
- New algorithms for approximate Nash equilibria in bimatrix games
- An algorithm for finding approximate Nash equilibria in bimatrix games
- Finite uniform approximation of two-person games defined on a product of staircase-function infinite spaces
- On the exact polynomial time algorithm for a special class of bimatrix game
- Convergence method, properties and computational complexity for Lyapunov games
- Computing approximate Nash equilibria in polymatrix games
- Approximate well-supported Nash equilibria in symmetric bimatrix games
- Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem
- Computing approximate Nash equilibria in general network revenue management games
- The cover number of a matrix and its algorithmic applications
- On Nash-equilibria of approximation-stable games
- scientific article; zbMATH DE number 5606343 (Why is no real title available?)
- Approximating Nash equilibria in tree polymatrix games
- A glimpse at Paul G. Spirakis
- An optimization approach for approximate Nash equilibria
- Computing exact and approximate Nash equilibria in 2-player games
- A web-based bimatrix game optimization model of polynomial complexity
- Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
- On perfect Nash equilibria of polymatrix games
- Recent development in computational complexity characterization of Nash equilibrium
- Nash equilibria in perturbation-stable games
- Efficient decomposition of bimatrix games (extended abstract)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Computing approximate Nash equilibria in polymatrix games
- Approximate Equilibria for Strategic Two Person Games
- LATIN 2004: Theoretical Informatics
- 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
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
- Evolutionarily stable strategy in asymmetric games: dynamical and information-theoretical perspectives
- Computing Nash equilibria by iterated polymatrix approximation
- Well supported approximate equilibria in bimatrix games
This page was built for publication: Polynomial algorithms for approximating Nash equilibria of bimatrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014631)
