Zero-Sum Polymatrix Games: A Generalization of Minmax
Lists
Only you see this
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 ...
BibTeX
@article{cai2016zero,
author = {Yang Cai and Ozan Candogan and Constantinos Daskalakis and Christos H. Papadimitriou},
title = {{Zero-Sum Polymatrix Games: A Generalization of Minmax}},
journal = {Math. Oper. Res.},
year = {2016},
doi = {10.1287/moor.2015.0745},
}