Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

We prove an N
^2-o(1)
lower bound on the randomized communication complexity of finding an ε-approximate Nash equilibrium (for constant ε>0) in a two-player N×N game.