Approximating the best Nash Equilibrium in $n^{o(log n)}$- time breaks the Exponential Time Hypothesis | Omri Weinstein

Approximating the best Nash Equilibrium in $n^{o(log n)}$- time breaks the Exponential Time Hypothesis

Mark Braverman, Kun-Ko, Young , and Weinstein, Omri . 2015. “Approximating The Best Nash Equilibrium In&Nbsp;$N^{O(Log N)}$-&Nbsp;Time Breaks The Exponential Time Hypothesis”. In Proceedings Of The Twenty-Sixth Annual Acm-Siam Symposium On Discrete Algorithms, Soda 2015, San Diego, Ca, Usa, January 4-6, 2015, Pp. 970–982. SIAM. doi:10.1137/1.9781611973730.66. Publisher's Version

Last updated on 10/25/2021