A Bound on the Proportion of Pure Strategy Equilibria in Generic Games

DOI10.1287/moor.18.3.548zbMath0804.90144OpenAlexW2116353405MaRDI QIDQ3140532

Ennio Stacchetti, David G. Pearce, Faruk Gul

Publication date: 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/de30d750684259ff2e016f11b5a063ebd14db3fc

zbMATH Keywords

Nash equilibriageneric finite normal form gamenondegenerate mixed strategy equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) Cooperative games (91A12)

Related Items (21)

Nash blocks ⋮ Structure theorems for game trees ⋮ The maximal generic number of pure Nash equilibria ⋮ A theorem on the number of Nash equilibria in a bimatrix game ⋮ Equivalence and invariance of the index and degree of Nash equilibria ⋮ Affective empathy in non-cooperative games ⋮ A sandwich theorem for generic \(n \times n\) two person games ⋮ Dynamic stability of the set of Nash equilibria in stable stochastic games ⋮ On sustainable equilibria ⋮ A global Newton method to compute Nash equilibria. ⋮ Nash equilibria in random games with right fat-tailed distributions ⋮ Polytope-form games and index/degree theories for extensive-form games ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Essential equilibria ⋮ Computing Nash equilibria by iterated polymatrix approximation ⋮ Regularity and robustness in monotone Bayesian games ⋮ Generic \(4\times 4\) two person games have at most 15 Nash equilibria ⋮ On the indices of zeros of Nash fields ⋮ Excess payoff dynamics and other well-behaved evolutionary dynamics ⋮ Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games ⋮ On (un)knots and dynamics in games

This page was built for publication: A Bound on the Proportion of Pure Strategy Equilibria in Generic Games