Zero-sum polymatrix games: a generalization of minmax

DOI10.1287/MOOR.2015.0745MaRDI QIDQ2806824zbMATH OpenOpenAlexFDO

Authors Yang Cai, Ozan Candogan, Constantinos Daskalakis, Christos 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

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

Recommendations

• On minmax theorems for multiplayer games
• Computing Proper Equilibria of Zero-Sum Games
• Computing approximate Nash equilibria in polymatrix games
• Computing approximate Nash equilibria in polymatrix games
• On a Network Generalization of the Minmax Theorem

Cites work

• scientific article; zbMATH DE number 4049433 (Why is no real title available?)
• A Note on Strictly Competitive Games
• Adaptive game playing using multiplicative weights
• On minmax theorems for multiplayer games
• On separable non-cooperative zero-sum games
• Prediction, Learning, and Games
• Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
• The complexity of computing a Nash equilibrium

Cited in

(23)

• Fictitious play in networks
• Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory
• Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
• A generalization of a classical zero-sum problem
• Separable Network Games with Compact Strategy Sets
• Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
• Computing Proper Equilibria of Zero-Sum Games
• Strict equilibria interchangeability in multi-player zero-sum games
• The polymatrix gap conjecture
• The complexity of the parity argument with potential
• Multiple oracle algorithm to solve continuous games
• On the Shapley value of liability games
• Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty
• Minimax representation of nonexpansive functions and application to zero-sum recursive games
• Semidefinite games
• Strategic decompositions of normal form games: zero-sum games and potential games
• The duality gap for two-team zero-sum games
• Automated equilibrium analysis of \(2\times 2\times 2\) games
• Polymatrix games and optimization problems
• A note on polymatrix games
• On a Network Generalization of the Minmax Theorem
• On minmax theorems for multiplayer games
• A logical description of priority separable games

This page was built for publication: Zero-sum polymatrix games: a generalization of minmax

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