Asymptotic expected number of Nash equilibria of two-player normal form games

DOI10.1016/j.geb.2004.10.008zbMath1139.91303MaRDI QIDQ2485483

Johannes Berg, Andrew McLennan

Publication date: 5 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.geb.2004.10.008

zbMATH Keywords

Nash equilibrium; Statistical mechanics; Computational complexity; Disordered systems; Two-player games; Normal form games; Random games

Mathematics Subject Classification ID

91A10: Noncooperative games

82B44: Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics

Related Items

On Random Symmetric Bimatrix Games, Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph, Complex dynamics in learning complicated games, Best-response dynamics, playing sequences, and convergence to equilibrium in random games, Random extensive form games, On the expected number of equilibria in a multi-player multi-strategy evolutionary game, Analysis of the expected density of internal equilibria in random evolutionary multi-player multi-strategy games, The complexity of game isomorphism, The number of pure Nash equilibria in a random game with nondecreasing best responses, Simple search methods for finding a Nash equilibrium, More strategies, more Nash equilibria, On the support size of stable strategies in random games, The distribution of optimal strategies in symmetric zero-sum games, Computing equilibria for integer programming games, Golden games, Rationalizable strategies in random games, Nash equilibria of Cauchy-random zero-sum and coordination matrix games, On a class of optimization problems with no ``efficiently computable solution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate distributions of order statistics. With applications to nonparametric statistics
• Nash and correlated equilibria: Some complexity considerations
• Generic \(4\times 4\) two person games have at most 15 Nash equilibria
• New maximal numbers of equilibria in bimatrix games
• 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
• Rigorous results for the Hopfield model with many patterns
• 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
• The expected number of real roots of a multihomogeneous system of polynomial equations
• Probability of a pure equilibrium point in n-person games