On mutual concavity and strategically-zero-sum bimatrix games
From MaRDI portal
Publication:428856
DOI10.1016/j.tcs.2012.01.016zbMath1242.68123OpenAlexW2052308126MaRDI QIDQ428856
Paul G. Spirakis, Spyros C. Kontogiannis
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.016
quadratic optimizationcorrelated equilibriumbimatrix gamesNash equilibrium computationstrategically-zero-sum games
Analysis of algorithms and problem complexity (68Q25) Quadratic programming (90C20) 2-person games (91A05)
Related Items
A note on anti-Nash equilibrium for bimatrix game, A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for indefinite quadratic programming
- Games of fixed rank: a hierarchy of bimatrix games
- Well supported approximate equilibria in bimatrix games
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- Nash and correlated equilibria: Some complexity considerations
- On sparse approximations to randomized strategies and convex combinations
- On the geometry of Nash equilibria and correlated equilibria
- A note on correlated equilibrium
- Two-person nonzero-sum games and quadratic programming
- An iterative method of solving a game
- On the convergence of regret minimization dynamics in concave games
- The Complexity of Computing a Nash Equilibrium
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
- Equilibrium Points of Bimatrix Games
- Rank-1 bimatrix games
- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
