Emergent Mind
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
(1805.06387)
Published May 16, 2018
in
cs.CC
and
cs.GT
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.