Communication complexity of Nash equilibrium in potential games

Cited by: 0|Bibtex|Views2
Other Links: arxiv.org

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 $poly(N)$ communication in two-player $N \times N$ potential games, and $2^{poly(n)}$ communication in $n$-player two-action games. To the best of our knowledge, these a...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments