@inproceedings{7f0f80f5ead447db88a6615311c52c16,
title = "Communication complexity of approximate Nash equilibria",
abstract = "For a constant ϵ, we prove a poly(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 that at least (1 - ϵ)-fraction of the players are ϵ-best replying.",
keywords = "Approximate nash equilibria, Communication complexity, Convergence rate, Uncoupled dynamics",
author = "Yakov Babichenko and Aviad Rubinstein",
note = "Publisher Copyright: {\textcopyright} 2017 ACM.; 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 ; Conference date: 19-06-2017 Through 23-06-2017",
year = "2017",
month = jun,
day = "19",
doi = "10.1145/3055399.3055407",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "878--889",
editor = "Pierre McKenzie and Valerie King and Hamed Hatami",
booktitle = "STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing",
}