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...

詳細記述

書誌詳細
主要な著者: Cai, Yang, Daskalakis, Constantinos
その他の著者: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
フォーマット: 論文
言語:en_US
出版事項: Society for Industrial and Applied Mathematics 2012
オンライン・アクセス:http://hdl.handle.net/1721.1/73129
https://orcid.org/0000-0002-5451-0490