Zero-sum polymatrix games: a generalization of minmax
DOI10.1287/MOOR.2015.0745zbMATH Open1336.91009OpenAlexW2288719682MaRDI QIDQ2806824FDOQ2806824
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
Recommendations
zero-sum gamespolymatrix gamesconvergence of no-regret dynamicsefficient algorithm for Nash equilibria
Distributed algorithms (68W15) (n)-person games, (n>2) (91A06) Games involving graphs (91A43) General topics in the theory of algorithms (68W01)
Cites Work
- Prediction, Learning, and Games
- 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
- On minmax theorems for multiplayer games
- On separable non-cooperative zero-sum games
- A Note on Strictly Competitive Games
- Title not available (Why is that?)
Cited In (23)
- 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
- A logical description of priority separable games
- On minmax theorems for multiplayer games
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
- A generalization of a classical zero-sum problem
- On a Network Generalization of the Minmax Theorem
- Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
- On the Shapley value of liability games
- Strict equilibria interchangeability in multi-player zero-sum games
- Polymatrix games and optimization problems
- Computing Proper Equilibria of Zero-Sum Games
- The complexity of the parity argument with potential
- Fictitious play in networks
- Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory
- The polymatrix gap conjecture
- A note on polymatrix games
- Semidefinite games
- Strategic decompositions of normal form games: zero-sum games and potential games
- Automated equilibrium analysis of \(2\times 2\times 2\) games
- The duality gap for two-team zero-sum games
- Multiple oracle algorithm to solve continuous games
- Separable Network Games with Compact Strategy Sets
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)
