In the recent paper of~\cite{BR16}, the authors show that, for any constant 10^{-15} > \varepsilon > 0 the communication complexity of \varepsilon-approximate Nash equilibria in 2-player n \times n games is n^{\Omega(\varepsilon)}, resolving the long open problem of whether or not there exists a polylogarithmic communication protocol. In this paper ... more >>>