2000 character limit reached
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (1805.06387v1)
Published 16 May 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.