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

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.

[1]  I. Althöfer.  On sparse approximations to randomized strategies and convex combinations , 1994 .

[2]  John Fearnley,et al.  Inapproximability Results for Approximate Nash Equilibria , 2016, WINE.

[3]  Russell Impagliazzo,et al.  AM with Multiple Merlins , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[4]  Yu Cheng,et al.  Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games , 2015, EC.

[5]  Peter Bro Miltersen,et al.  Send mixed signals: earn more, work less , 2012, EC '12.

[6]  Mark Braverman,et al.  Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis , 2015, Electron. Colloquium Comput. Complex..

[7]  Constantinos Daskalakis,et al.  On the complexity of approximating a Nash equilibrium , 2011, SODA '11.

[8]  Omri Weinstein,et al.  ETH Hardness for Densest-k-Subgraph with Perfect Completeness , 2015, SODA.

[9]  Yakov Babichenko,et al.  Can Almost Everybody be Almost Happy? , 2015, ITCS.

[10]  Nicole Immorlica,et al.  Constrained signaling for welfare and revenue maximization , 2013, SECO.

[11]  Li Han,et al.  Mixture Selection, Mechanism Design, and Signaling , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[12]  George A. Akerlof,et al.  The Market for `Lemons , 1970 .

[13]  Moshe Tennenholtz,et al.  Signaling schemes for revenue maximization , 2012, EC '12.

[14]  Shaddin Dughmi,et al.  On the Hardness of Signaling , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[15]  Christos H. Papadimitriou,et al.  On oblivious PTAS's for nash equilibrium , 2009, STOC '09.

[16]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..