On mutual concavity and strategically-zero-sum bimatrix games
DOI10.1016/J.TCS.2012.01.016zbMATH Open1242.68123OpenAlexW2052308126MaRDI QIDQ428856FDOQ428856
Authors: P. G. Spirakis, Spyros 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
Recommendations
- Equilibria in constrained concave bimatrix games
- On pure equilibria for bimatrix games
- On the structure of the set of perfect equilibria in bimatrix games
- On the set of proper equilibria of a bimatrix game
- scientific article; zbMATH DE number 19354
- On two-point Nash equilibria in bimatrix games with convexity properties
- scientific article; zbMATH DE number 540437
- scientific article; zbMATH DE number 4183223
- A generalization of the Nash equilibrium theorem on bimatrix games
- Bimatrix games have quasi-strict equilibria
quadratic optimizationbimatrix gamescorrelated equilibriumNash equilibrium computationstrategically-zero-sum games
Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)
Cites Work
- Theory of games and economic behavior.
- Title not available (Why is that?)
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- The complexity of computing a Nash equilibrium
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Equilibrium Points of Bimatrix Games
- Approximation algorithms for indefinite quadratic programming
- An iterative method of solving a game
- Two-person nonzero-sum games and quadratic programming
- Rank-1 bimatrix games, a homeomorphism and a polynomial time algorithm
- Well supported approximate equilibria in bimatrix games
- On the convergence of regret minimization dynamics in concave games
- On the geometry of Nash equilibria and correlated equilibria
- On sparse approximations to randomized strategies and convex combinations
- Nash and correlated equilibria: Some complexity considerations
- A note on correlated equilibrium
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
Cited In (6)
- Title not available (Why is that?)
- A note on anti-Nash equilibrium for bimatrix game
- A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
- Two-person adversarial games are zero-sum: an elaboration of a folk theorem
- Exploiting concavity in bimatrix games: new polynomially tractable subclasses
- Title not available (Why is that?)
This page was built for publication: On mutual concavity and strategically-zero-sum bimatrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428856)
