| dc.contributor.author | Cai, Yang | |
| dc.contributor.author | Candogan, Ozan | |
| dc.contributor.author | Papadimitriou, Christos | |
| dc.contributor.author | Daskalakis, Konstantinos | |
| dc.date.accessioned | 2017-07-25T15:42:18Z | |
| dc.date.available | 2017-07-25T15:42:18Z | |
| dc.date.issued | 2016-01 | |
| dc.date.submitted | 2012-10 | |
| dc.identifier.issn | 0364-765X | |
| dc.identifier.issn | 1526-5471 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/110830 | |
| dc.description.abstract | 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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (CCF-0953960) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (CCF-1101491) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Institute for Operations Research and the Management Sciences (INFORMS) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1287/moor.2015.0745 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | MIT Web Domain | en_US |
| dc.title | Zero-Sum Polymatrix Games: A Generalization of Minmax | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Cai, Yang; Candogan, Ozan; Daskalakis, Constantinos, et al. “Zero-Sum Polymatrix Games: A Generalization of Minmax.” Mathematics of Operations Research 41, 2 (May 2016): 648–655. © 2016 Institute for Operations Research and the Management Sciences (INFORMS) | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Daskalakis, Konstantinos | |
| dc.relation.journal | Mathematics of Operations Research | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Cai, Yang; Candogan, Ozan; Daskalakis, Constantinos; Papadimitriou, Christos | en_US |
| dspace.embargo.terms | N | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-5451-0490 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
