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...
| Päätekijät: | , |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | Artikkeli |
| Kieli: | en_US |
| Julkaistu: |
Society for Industrial and Applied Mathematics
2012
|
| Linkit: | http://hdl.handle.net/1721.1/73129 https://orcid.org/0000-0002-5451-0490 |