Zero-Sum Polymatrix Games: A Generalization of Minmax

DOI10.1287/moor.2015.0745zbMath1336.91009OpenAlexW2288719682MaRDI QIDQ2806824

Constantinos Daskalakis, Yang Cai, Ozan Candogan, Christos H. Papadimitriou

Publication date: 19 May 2016

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/110830

zbMATH Keywords

zero-sum gamespolymatrix gamesconvergence of no-regret dynamicsefficient algorithm for Nash equilibria

Mathematics Subject Classification ID

Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Distributed algorithms (68W15) General topics in the theory of algorithms (68W01)

Related Items (11)

The Polymatrix Gap Conjecture ⋮ Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory ⋮ On the Shapley value of liability games ⋮ Automated equilibrium analysis of \(2\times 2\times 2\) games ⋮ Multiple oracle algorithm to solve continuous games ⋮ Strategic decompositions of normal form games: zero-sum games and potential games ⋮ Fast convergence of optimistic gradient ascent in network zero-sum extensive form games ⋮ Fictitious play in networks ⋮ Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution ⋮ Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty ⋮ The complexity of the parity argument with potential

Cites Work

• Unnamed Item
• Unnamed Item
• Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
• Adaptive game playing using multiplicative weights
• The complexity of computing a Nash equilibrium
• A Note on Strictly Competitive Games
• On separable non-cooperative zero-sum games
• Prediction, Learning, and Games

This page was built for publication: Zero-Sum Polymatrix Games: A Generalization of Minmax