Hard-to-Solve Bimatrix Games
From MaRDI portal
Publication:5489083
DOI10.1111/j.1468-0262.2006.00667.xzbMath1145.91301OpenAlexW2108614294MaRDI QIDQ5489083
Rahul Savani, Bernhard von Stengel
Publication date: 25 September 2006
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1468-0262.2006.00667.x
Noncooperative games (91A10) 2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (38)
Games with the total bandwagon property meet the Quint-Shubik conjecture ⋮ How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard? ⋮ ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria ⋮ A decomposition algorithm for \(N\)-player games ⋮ Computing equilibria: a computational complexity perspective ⋮ A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities ⋮ Constant Rank Two-Player Games are PPAD-hard ⋮ ReGale: some memorable results ⋮ New interpretations of the higher Stasheff-Tamari orders ⋮ The Exact Computational Complexity of Evolutionarily Stable Strategies ⋮ A note on anti-Nash equilibrium for bimatrix game ⋮ Nash equilibria in random games with right fat-tailed distributions ⋮ Strategic decompositions of normal form games: zero-sum games and potential games ⋮ Tropical Complementarity Problems and Nash Equilibria ⋮ Euler Complexes ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ Understanding PPA-completeness ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ Equilibria, fixed points, and complexity classes ⋮ Games in oriented matroids ⋮ New complexity results about Nash equilibria ⋮ Computing the cores of strategic games with punishment-dominance relations ⋮ Semidefinite programming for min-max problems and games ⋮ Exponentiality of the exchange algorithm for finding another room-partitioning ⋮ On Stackelberg mixed strategies ⋮ On the complexity of deciding bimatrix games similarity ⋮ Well supported approximate equilibria in bimatrix games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Imitation games and computation ⋮ Approximate Equilibria for Strategic Two Person Games ⋮ Existence of equilibria in a decentralized two-level supply chain ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ Fast Algorithms for Rank-1 Bimatrix Games ⋮ Semidefinite Programming and Nash Equilibria in Bimatrix Games ⋮ Oriented Euler complexes and signed perfect matchings ⋮ Mature or emerging markets: competitive duopoly investment decisions ⋮ Game Theory Explorer: software for the applied game theorist
This page was built for publication: Hard-to-Solve Bimatrix Games
