The Expected Number of Nash Equilibria of a Normal Form Game
From MaRDI portal
Publication:5393910
DOI10.1111/j.1468-0262.2005.00567.xzbMath1152.91326OpenAlexW2054951214MaRDI QIDQ5393910
Publication date: 24 October 2006
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: http://purl.umn.edu/55856
computational complexityNash equilibriumrotational invariancealgebraic geometryrandom gamesnumber of equilibria
Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60) Stochastic games, stochastic differential games (91A15)
Related Items
Homotopy methods to compute equilibria in game theory, The frequency of convergent games under best-response dynamics, 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, Best-response dynamics, playing sequences, and convergence to equilibrium in random games, Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise, The computation of pairwise stable networks, Nash equilibria in random games with right fat-tailed distributions, The number of pure Nash equilibria in a random game with nondecreasing best responses, New complexity results about Nash equilibria, Golden games, Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems, The distribution of optimal strategies in symmetric zero-sum games, Nash equilibria via duality and homological selection, Nash equilibria of Cauchy-random zero-sum and coordination matrix games, More strategies, more Nash equilibria, On the support size of stable strategies in random games, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Multiple equilibria and selection by learning in an applied setting, Applications of Algebra for Some Game Theoretic Problems, On Random Symmetric Bimatrix Games, A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
