Hartwig Bosse

Learn More
We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. Our work improves the previously best known (0.38197 +)-approximation algorithm of Daskalakis, Mehta and Pa-padimitriou [6]. First, we provide a(More)
  • 1