On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game

DOI10.1006/game.1997.0531zbMath0911.90352OpenAlexW1968397877MaRDI QIDQ1378021

Hans Keiding

Publication date: 16 May 1999

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

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

zbMATH Keywords

bimatrix gameNash quilibria

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (10)

Games with the total bandwagon property meet the Quint-Shubik conjecture ⋮ Games of fixed rank: a hierarchy of bimatrix games ⋮ Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games ⋮ A sandwich theorem for generic \(n \times n\) two person games ⋮ Nash equilibria in random games with right fat-tailed distributions ⋮ Asymptotic expected number of Nash equilibria of two-player normal form games ⋮ Geometrie und Kombinatorik von Nash-Gleichgewichten. ⋮ Generic \(4\times 4\) two person games have at most 15 Nash equilibria ⋮ Inner diagonals of convex polytopes ⋮ Circulant games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on the number of Nash equilibria in a bimatrix game
• The numbers of faces of simplicial polytopes
• Lectures on Polytopes
• An enumeration of simplicial 4-polytopes with 8 vertices

This page was built for publication: On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game