The Polymatrix Gap Conjecture

DOI10.1142/S0219198922500050zbMath1498.91016WikidataQ113776910 ScholiaQ113776910MaRDI QIDQ5038398

Italo Simonelli, Pavel Naumov

Publication date: 30 September 2022

Published in: International Game Theory Review (Search for Journal in Brave)

zbMATH Keywords

zero-sum gamespolymatrix gamespure Nash equilibriarelation on classes of games

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
• Computing Nash equilibria by iterated polymatrix approximation
• Copositive-plus Lemke algorithm solves polymatrix games
• A note on polymatrix games
• On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
• Zero-Sum Polymatrix Games: A Generalization of Minmax
• Equilibria of Polymatrix Games

This page was built for publication: The Polymatrix Gap Conjecture