Nash equilibrium is one of the most influential solution concepts in game theory. With the
development of computer science and artificial intelligence, there is an increasing demand …

In our recent paper [Rubinstein 2016] we rule out a PTAS for the 2-Player Nash Equilibrium
Problem. More precisely, we prove that there exists a constant ϵ> 0 such that, assuming the …

Since the celebrated PPAD-completeness result for Nash equilibria in bimatrix games, a
long line of research has focused on polynomial-time algorithms that compute ε-approximate …

We investigate how robust are results of committee elections to small changes in the input
preference orders, depending on the voting rules used. We find that for typical rules the …

In an ϵ ϵ-Nash equilibrium, a player can gain at most ϵ ϵ by unilaterally changing his
behavior. For two-player (bimatrix) games with payoffs in 0, 1, the best-known ϵ ϵ …

We show that, for any sufficiently small fixed $\epsilon> 0$, when both players in a general-
sum two-player (bimatrix) game employ optimistic mirror descent (OMD) with smooth …

Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria Page 1 Copyright
© by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. © 2021 …

We study the deterministic and randomized query complexity of finding approximate
equilibria in ak× k bimatrix game. We show that the deterministic query complexity of finding …

Since the seminal PPAD-completeness result for computing a Nash equilibrium even in two-
player games, an important line of research has focused on relaxations achievable in …

In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an ε-
approximate Nash equilibrium with near-optimal value in a two-player game is as hard as …