On minmax theorems for multiplayer games
We prove a generalization of von Neumann's minmax theorem to the class of separable multiplayer zero-sum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix---that is, graphical games in which every edge is a two-player game between its endpoints---in which every outcome h...
Main Authors: | Cai, Yang, Daskalakis, Constantinos |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics
2012
|
Online Access: | http://hdl.handle.net/1721.1/73129 https://orcid.org/0000-0002-5451-0490 |
Similar Items
-
Zero-Sum Polymatrix Games: A Generalization of Minmax
by: Cai, Yang, et al.
Published: (2017) -
Multiplayer quantum games
by: Benjamin, S, et al.
Published: (2001) -
Massively multiplayer game development /
by: 213209 Alexander, Thor, et al.
Published: (2003) -
The Multiplayer Colonel Blotto Game
by: Boix-Adsera, Enric, et al.
Published: (2022) -
Deep MinMax Networks
by: Lohmiller, Winfried, et al.
Published: (2024)