@inproceedings{756a1b9af61a42c2bb061cca2f1943a5,
title = "Communication complexity of nash equilibrium in potential games (extended abstract)",
abstract = "We prove communication complexity lower bounds for (possibly mixed) Nash equilibrium in potential games. In particular, we show that finding a Nash equilibrium requires text{poly}(N) communication in two-player N times N potential games, and 2{text{poly}(n)} communication in n-player two-action games. To the best of our knowledge, these are the first results to demonstrate hardness in any model of (possibly mixed) Nash equilibrium in potential games.",
keywords = "Computation theory, Game theory",
author = "Yakov Babichenko and Aviad Rubinstein",
note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 ; Conference date: 16-11-2020 Through 19-11-2020",
year = "2020",
month = nov,
doi = "10.1109/FOCS46700.2020.00137",
language = "الإنجليزيّة",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
pages = "1439--1445",
booktitle = "Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020",
}