The maximal number of regular totally mixed Nash equilibria
From MaRDI portal
Publication:1363373
DOI10.1006/jeth.1996.2214zbMath0883.90130OpenAlexW2151329291MaRDI QIDQ1363373
Richard D. McKelvey, Andrew McLennan
Publication date: 7 August 1997
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://authors.library.caltech.edu/80745/
Related Items
Multihomogeneous resultant formulae by means of complexes, Finding all Nash equilibria of a finite game using polynomial algebra, On some geometry and equivalence classes of normal form games, The maximal generic number of pure Nash equilibria, A global optimization algorithm for solving a four-person game, Unmixing the mixed volume computation, Automated equilibrium analysis of \(2\times 2\times 2\) games, Nash equilibria in random games with right fat-tailed distributions, Uniqueness of stationary equilibrium payoffs in coalitional bargaining, Unnamed Item, Simple search methods for finding a Nash equilibrium, Counting derangements and Nash equilibria, Asymptotic expected number of Nash equilibria of two-player normal form games, Introduction: Special issue of ``Games and Economic Behavior in honor of Richard D. McKelvey, Geometrie und Kombinatorik von Nash-Gleichgewichten., Universality of Nash components, A parametric representation of totally mixed Nash equilibria, On the topology of the set of Nash equilibria, The Bottleneck Degree of Algebraic Varieties, Generic \(4\times 4\) two person games have at most 15 Nash equilibria, Applications of Algebra for Some Game Theoretic Problems, Circulant games, A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
Cites Work
