The maximal generic number of pure Nash equilibria

DOI10.1006/jeth.1996.2213zbMath0883.90131OpenAlexW2036401256MaRDI QIDQ1363372

Andrew McLennan

Publication date: 23 March 1998

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: http://purl.umn.edu/55720

zbMATH Keywords

pure strategy Nash equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (11)

Random extensive form games ⋮ A sandwich theorem for generic \(n \times n\) two person games ⋮ Unmixing the mixed volume computation ⋮ Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise ⋮ Uniqueness of stationary equilibrium payoffs in coalitional bargaining ⋮ Golden games ⋮ Asymptotic expected number of Nash equilibria of two-player normal form games ⋮ Generic \(4\times 4\) two person games have at most 15 Nash equilibria ⋮ On the testable implications of collective choice theories ⋮ Circulant games ⋮ A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games

Cites Work

• The maximal number of regular totally mixed Nash equilibria
• A theorem on the number of Nash equilibria in a bimatrix game
• A Bound on the Proportion of Pure Strategy Equilibria in Generic Games

This page was built for publication: The maximal generic number of pure Nash equilibria