Tight SoS-Degree Bounds for Approximate Nash Equilibria
Nash equilibria always exist, but are widely conjectured to require time to find that is exponential in the number of strategies, even for two-player games. By contrast, a simple quasi-polynomial time algorithm, due to Lipton, Markakis and Mehta (LMM), can find approximate Nash equilibria, in which...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
2017
|
| Online Access: | http://hdl.handle.net/1721.1/109803 https://orcid.org/0000-0003-3220-7682 https://orcid.org/0000-0003-3648-3844 |