Communication complexity of approximate Nash equilibria
STOC, pp. 878-889, 2017.
For a constant Ñ, we prove a (N) lower bound on the (randomized) communication complexity of Ñ-Nash equilibrium in two-player NÃ N games. For n-player binary-action games we prove an exp(n) lower bound for the (randomized) communication complexity of (Ñ,Ñ)-weak approximate Nash equilibrium, which is a profile of mixed actions such th...More
PPT (Upload PPT)