The maximal number of regular totally mixed Nash equilibria

DOI10.1006/JETH.1996.2214zbMATH Open0883.90130OpenAlexW2151329291MaRDI QIDQ1363373FDOQ1363373

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/

zbMATH Keywords

regular totally mixed Nash equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cites Work

• Oddness of the number of equilibrium points: a new proof
• The number of roots of a system of equations
• Finite \(N\)-person non-cooperative games with unique equilibrium points
• Structure of equilibria in N-person non-cooperative games

Cited In (26)

• Circulant games
• A parametric representation of totally mixed Nash equilibria
• Multihomogeneous resultant formulae by means of complexes
• Asymptotic expected number of Nash equilibria of two-player normal form games
• Counting \(\mathcal{N} = 8\) black holes as algebraic varieties
• Title not available (Why is that?)
• On some geometry and equivalence classes of normal form games
• Generic \(4\times 4\) two person games have at most 15 Nash equilibria
• The maximal generic number of pure Nash equilibria
• Unmixing the mixed volume computation
• Nash equilibria in random games with right fat-tailed distributions
• Universality of Nash components
• Geometrie und Kombinatorik von Nash-Gleichgewichten.
• Applications of Algebra for Some Game Theoretic Problems
• Simple search methods for finding a Nash equilibrium
• Introduction: Special issue of ``Games and Economic Behavior in honor of Richard D. McKelvey
• Enumerative and structural aspects of anagrams without fixed letters
• Game theory of undirected graphical models
• The Bottleneck Degree of Algebraic Varieties
• Automated equilibrium analysis of \(2\times 2\times 2\) games
• On the topology of the set of Nash equilibria
• A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
• Finding all Nash equilibria of a finite game using polynomial algebra
• A global optimization algorithm for solving a four-person game
• Counting derangements and Nash equilibria
• Uniqueness of stationary equilibrium payoffs in coalitional bargaining

   Recommendations

• The maximal generic number of pure Nash equilibria 👍 👎
• On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game 👍 👎
• Generic \(4\times 4\) two person games have at most 15 Nash equilibria 👍 👎

This page was built for publication: The maximal number of regular totally mixed Nash equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363373)