License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.12
URN: urn:nbn:de:0030-drops-94163
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9416/
Go to the corresponding LIPIcs Volume Portal

Ganor, Anat ; C. S., Karthik

Communication Complexity of Correlated Equilibrium with Small Support

pdf-format:
LIPIcs-APPROX-RANDOM-2018-12.pdf (0.5 MB)

Abstract

We define a two-player N x N game called the 2-cycle game, that has a unique pure Nash equilibrium which is also the only correlated equilibrium of the game. In this game, every 1/poly(N)-approximate correlated equilibrium is concentrated on the pure Nash equilibrium. We show that the randomized communication complexity of finding any 1/poly(N)-approximate correlated equilibrium of the game is Omega(N). For small approximation values, our lower bound answers an open question of Babichenko and Rubinstein (STOC 2017).

BibTeX - Entry

@InProceedings{ganor_et_al:LIPIcs:2018:9416,
  author =	{Anat Ganor and Karthik C. S.},
  title =	{{Communication Complexity of Correlated Equilibrium with Small Support}},
  booktitle =	{Approximation, Randomization, and Combinatorial  Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
  pages =	{12:1--12:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-085-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{116},
  editor =	{Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9416},
  URN =		{urn:nbn:de:0030-drops-94163},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2018.12},
  annote =	{Keywords: Correlated equilibrium, Nash equilibrium, Communication complexity}
}

Keywords: Correlated equilibrium, Nash equilibrium, Communication complexity
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Issue Date: 2018
Date of publication: 13.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI