"Settling the complexity of computing approximate two-player Nash equilibria."

Aviad Rubinstein (2017)
a service of Schloss Dagstuhl - Leibniz Center for Informatics