New maximal numbers of equilibria in bimatrix games

DOI10.1007/PL00009438zbMath0956.91003OpenAlexW2126064738MaRDI QIDQ1293674

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

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

Related Items (22)

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

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