Mathematics of Operations Research · 2016 · 51 citations · 5 references
Social SciencesMathematicsGame TheoryMicroeconomicsOptimizationAlgorithmic Game TheoryCombinatorial Game TheoryLinear ProgrammingNash EquilibriumNoncooperative Game TheoryZero-sum GamesDuality In Game TheoryEquilibrium ComputationMatrix GamesMultiplayer GamesNash Equilibrium ComputationNash Equilibrium ProblemsTwo-player Games
We show that in zero-sum polymatrix games, a multiplayer generalization of two-person zero-sum games, Nash equilibria can be found efficiently with linear programming. We also show that the set of coarse correlated equilibria collapses to the set of Nash equilibria. In contrast, other important properties of two-person zero-sum games are not preserved: Nash equilibrium payoffs need not be unique, and Nash equilibrium strategies need not be exchangeable or max-min.
5
On Minmax Theorems for Multiplayer Games
Yang Cai, Constantinos Daskalakis · 2011 · 54 citations
On separable non-cooperative zero-sum games
L.M. Bergman, Iu N Fokin · Optimization · 1998 · 16 citations