On the complexity of deciding bimatrix games similarity
From MaRDI portal
Publication:955038
DOI10.1016/j.tcs.2008.07.021zbMath1151.91012OpenAlexW2062992879MaRDI QIDQ955038
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.021
2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- New complexity results about Nash equilibria
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
- Nash and correlated equilibria: Some complexity considerations
- On the complexity of the parity argument and other inefficient proofs of existence
- The complexity of computing a Nash equilibrium
- Settling the complexity of computing two-player Nash equilibria
- On the Complexity of Game Isomorphism
- Equilibrium Points of Bimatrix Games
- Hard-to-Solve Bimatrix Games
- Equilibrium points in n -person games