Bounds for the Communication Complexity of Approximate Correlated Equilibria

@inproceedings{Ko2017BoundsFT,
  title={Bounds for the Communication Complexity of Approximate Correlated Equilibria},
  author={Young Kun Ko and Ariel Schvartzman},
  year={2017}
}
In the recent paper of [BR16], the authors show that, for any constant 10−15 > ε > 0 the communication complexity of ε-approximate Nash equilibria in 2-player n× n games is n, resolving the long open problem of whether or not there exists a polylogarithmic communication protocol. In this paper we address an open question they pose regarding the… CONTINUE READING