Generic \(4\times 4\) two person games have at most 15 Nash equilibria

DOI10.1006/game.1998.0640zbMath0930.91003OpenAlexW2009035217MaRDI QIDQ1279618

In-Uck Park, Andrew McLennan

Publication date: 9 February 2000

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/game.1998.0640

zbMATH Keywords

maximal generic number of Nash equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05)

Related Items

Games with the total bandwagon property meet the Quint-Shubik conjecture, Games of fixed rank: a hierarchy of bimatrix games, A sandwich theorem for generic \(n \times n\) two person games, Strategic decompositions of normal form games: zero-sum games and potential games, New complexity results about Nash equilibria, Counting derangements and Nash equilibria, Asymptotic expected number of Nash equilibria of two-player normal form games, Geometrie und Kombinatorik von Nash-Gleichgewichten., Inner diagonals of convex polytopes, Circulant games

Cites Work

• Unnamed Item
• The maximal generic number of pure Nash equilibria
• The maximal number of regular totally mixed Nash equilibria
• A theorem on the number of Nash equilibria in a bimatrix game
• On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game
• A note on the probability of \(k\) pure Nash equilibria in matrix games
• Oddness of the number of equilibrium points: a new proof
• Limiting distributions of the number of pure strategy Nash equilibria in \(n\)-person games
• A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
• Lectures on Polytopes
• The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games
• An enumeration of simplicial 4-polytopes with 8 vertices
• Probability of a pure equilibrium point in n-person games