On the Communication Complexity of Approximate Nash Equilibria
We study the problem of computing approximate Nash equilibria, in a setting where players initially know their own payoffs but not the payoffs of other players. In order for a solution of reasonable quality to be found, some amount of communication needs to take place between the players. We are interested in algorithms where the communication is substantially less than the contents of a payoff matrix, for example logarithmic in the size of the matrix. At one extreme is the case where the players do not communicate at all; for this case (with 2 players having n×n matrices) ε-Nash equilibria can be computed for ε = 3/4, while there is a lower bound of slightly more than 1/2 on the lowest ε achievable. When the communication is polylogarithmic in n, we show how to obtain ε = 0.438. For one-way communication we show that ε = 1/2 is the exact answer.
KeywordsNash Rium Decen
Unable to display preview. Download preview PDF.
- 2.Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Procs. of the 47th FOCS Symposium, pp. 261–272. IEEE (2006)Google Scholar
- 3.Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 14:1–14:57 (2009)Google Scholar
- 4.Conitzer, V., Sandholm, T.: Communication complexity as a lower bound for learning in games. In: Proceedings of the 21st ICML, pp. 24–32 (2004)Google Scholar
- 5.Dantzig, G.B.: Linear Programming and Extensions. Princeton Univ. Press (1963)Google Scholar
- 11.Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: 16th STOC, pp. 302–311. ACM (1984)Google Scholar
- 13.Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Procs. of the 4th ACM-EC, EC 2003, pp. 36–41 (2003)Google Scholar
- 16.Pastink, A.: Aspects of communication complexity for approximating Nash equilibria. MSc dissertation, Utrecht University (2012)Google Scholar
- 18.Yao, A.C.C.: Some complexity questions related to distributive computing (preliminary report). In: 11th STOC, pp. 209–213. ACM (1979)Google Scholar