On mutual concavity and strategically-zero-sum bimatrix games

DOI10.1016/J.TCS.2012.01.016MaRDI QIDQ428856zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

quadratic optimizationbimatrix gamescorrelated equilibriumNash equilibrium computationstrategically-zero-sum games

Mathematics Subject Classification ID

Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)

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

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
• A note on correlated equilibrium
• An iterative method of solving a game
• Approximation algorithms for indefinite quadratic programming
• Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
• Equilibrium Points of Bimatrix Games
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Nash and correlated equilibria: Some complexity considerations
• On sparse approximations to randomized strategies and convex combinations
• On the convergence of regret minimization dynamics in concave games
• On the geometry of Nash equilibria and correlated equilibria
• Rank-1 bimatrix games, a homeomorphism and a polynomial time algorithm
• Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
• The complexity of computing a Nash equilibrium
• Theory of games and economic behavior.
• Two-person nonzero-sum games and quadratic programming
• Well supported approximate equilibria in bimatrix games

Cited in

(6)

• scientific article; zbMATH DE number 1944077 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1053348 (Why is no real title available?)

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)