License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.77
URN: urn:nbn:de:0030-drops-74057
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7405/
Go to the corresponding LIPIcs Volume Portal


Rubinstein, Aviad

Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder

pdf-format:
LIPIcs-ICALP-2017-77.pdf (0.6 MB)


Abstract

We prove that, assuming the exponential time hypothesis, finding an epsilon-approximately optimal symmetric signaling scheme in a two-player zero-sum game requires quasi-polynomial time. This is tight by [Cheng et al., FOCS'15] and resolves an open question of [Dughmi, FOCS'14]. We also prove that finding a multiplicative approximation is NP-hard. We also introduce a new model where a dishonest signaler may publicly commit to use one scheme, but post signals according to a different scheme. For this model, we prove that even finding a (1-2^{-n})-approximately optimal scheme is NP-hard.

BibTeX - Entry

@InProceedings{rubinstein:LIPIcs:2017:7405,
  author =	{Aviad Rubinstein},
  title =	{{Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder}},
  booktitle =	{44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
  pages =	{77:1--77:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-041-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{80},
  editor =	{Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7405},
  URN =		{urn:nbn:de:0030-drops-74057},
  doi =		{10.4230/LIPIcs.ICALP.2017.77},
  annote =	{Keywords: Signaling, Zero-sum Games, Algorithmic Game Theory, birthday repetition}
}

Keywords: Signaling, Zero-sum Games, Algorithmic Game Theory, birthday repetition
Seminar: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Issue Date: 2017
Date of publication: 06.07.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI