A theorem on the number of Nash equilibria in a bimatrix game

DOI10.1007/BF01263276zbMath0880.90141OpenAlexW4253228026MaRDI QIDQ1365001

Martin Shubik, Thomas Quint

Publication date: 28 August 1997

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01263276

zbMATH Keywords

bimatrix game

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (15)

Games with the total bandwagon property meet the Quint-Shubik conjecture ⋮ Local search in quadratic two-person game ⋮ The maximal generic number of pure Nash equilibria ⋮ On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game ⋮ A sandwich theorem for generic \(n \times n\) two person games ⋮ Strategic decompositions of normal form games: zero-sum games and potential games ⋮ Tropical Complementarity Problems and Nash Equilibria ⋮ Asymptotic expected number of Nash equilibria of two-player normal form games ⋮ Geometrie und Kombinatorik von Nash-Gleichgewichten. ⋮ More strategies, more Nash equilibria ⋮ Generic \(4\times 4\) two person games have at most 15 Nash equilibria ⋮ A bound on the number of Nash equilibria in a coordination game. ⋮ The number and type of long-term equilibria ⋮ Circulant games ⋮ Game Theory Explorer: software for the applied game theorist

Cites Work

• Unnamed Item
• Unnamed Item
• A bound on the number of Nash equilibria in a coordination game.
• Oddness of the number of equilibrium points: a new proof
• Non-cooperative games
• A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
• Regularity and Stability of Equilibrium Points of Bimatrix Games
• Equilibrium Points of Bimatrix Games
• The Linear Complementarity Problem
• Equilibrium points in n -person games

This page was built for publication: A theorem on the number of Nash equilibria in a bimatrix game