| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6873759 | Information and Computation | 2018 | 19 Pages |
Abstract
Our proofs are generally constructive, that is, provide upper bounds for the memory required, as well as algorithms to compute the relevant Nash equilibria.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stéphane Le Roux, Arno Pauly,