Zero-Sum Polymatrix Games: A Generalization of Minmax
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 prop...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/110830 https://orcid.org/0000-0002-5451-0490 |