Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (1805.06387v1)

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