Communication Complexity of Correlated Equilibrium in Two-Player Games

Anat Ganor, Karthik C. S.

We show a communication complexity lower bound for finding a correlated equilibrium of a two-player game. More precisely, we define a two-player $N\times N$ game called the 2-cycl…