New maximal numbers of equilibria in bimatrix games

DOI10.1007/PL00009438MaRDI QIDQ1293674zbMATH OpenOpenAlexFDO

Authors Bernhard von Stengel

Publication date 29 September 1999

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009438

zbMATH Keywords

Nash equilibriaspecial polytopes

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Recommendations

• On the maximal number of Nash equilibria in an n n bimatrix game
• A theorem on the number of Nash equilibria in a bimatrix game
• On the structure of the set of Nash equilibria of weakly nondegenerate bimatrix games

Cited in

(24)

• Uniqueness of stationary equilibrium payoffs in coalitional bargaining
• Circulant games
• Asymptotic expected number of Nash equilibria of two-player normal form games
• Bounds on the number of ESSs of a matrix game
• More strategies, more Nash equilibria
• Games with the total bandwagon property meet the Quint-Shubik conjecture
• Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise
• A theorem on the number of Nash equilibria in a bimatrix game
• Fast Algorithms for Rank-1 Bimatrix Games
• Finding all equilibria in games of strategic complements
• Inner diagonals of convex polytopes
• Game Theory Explorer: software for the applied game theorist
• Enumeration of Nash equilibria for two-player games
• Geometrie und Kombinatorik von Nash-Gleichgewichten.
• Oriented Euler complexes and signed perfect matchings
• Computing Nash equilibria by iterated polymatrix approximation
• A solution to matching with preferences over colleagues
• A sandwich theorem for generic \(n \times n\) two person games
• Tropical Complementarity Problems and Nash Equilibria
• Semidefinite games
• Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
• Counting derangements and Nash equilibria
• The computation of pairwise stable networks
• Bargaining with limited computation: Deliberation equilibrium

This page was built for publication: New maximal numbers of equilibria in bimatrix games

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