Zero-sum polymatrix games : a generalization of minmax
Yang Cai (School of Computer Science, McGill University, Montréal, Québec, Canada), Ozan Candogan (Booth School of Business, University of Chicago, Chicago, Illinois), Constantinos Daskalakis (Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts), Christos Papadimitriou (Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, California)
| Year of publication: |
May 2016
|
|---|---|
| Authors: | Cai, Yang ; Candogan, Ozan ; Daskalákis, Constantínos ; Papadimitriou, Christos H. |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 2, p. 648-655
|
| Subject: | polymatrix games | zero-sum games | efficient algorithm for Nash equilibria | convergence of no-regret dynamics | Spieltheorie | Game theory | Nash-Gleichgewicht | Nash equilibrium |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/moor.2015.0745 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011520515