On the Complexity of Approximating a Nash Equilibrium

Constantinos Daskalakis. On the Complexity of Approximating a Nash Equilibrium. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 1498-1517, SIAM, 2011. [doi]

Abstract

Abstract is missing.