Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

Abstract: We prove an $N<sup>{2-o(1)}$ lower bound on the randomized communication complexity of finding an $\epsilon$-approximate Nash equilibrium (for constant $\epsilon&gt;0$) in a two-player $N\times N$ game.