Leakage-Robust Bayesian Persuasion
Nika Haghtalab, Mingda Qiao, Kunhe Yang

TL;DR
This paper introduces leakage-robust Bayesian persuasion, analyzing how to design persuasion schemes resilient to signal leaks, and quantifies the utility loss under various leakage scenarios using two formal frameworks.
Contribution
It formalizes leakage-robust persuasion, provides bounds on utility loss for different leakage models, and introduces subsampling and masking as optimal transformation techniques.
Findings
Price of Worst-case Robustness (PoWR) is Θ(min{2^k, n}) for supermodular utilities.
Price of Downstream Robustness (PoDR) can be Θ(k) or Θ(1) under certain distributions.
Subsampling and masking are effective algorithms for leakage-robust persuasion schemes.
Abstract
We introduce the concept of leakage-robust Bayesian persuasion. Situated between public persuasion [KG11, CCG23, Xu20] and private persuasion [AB19], leakage-robust persuasion considers a setting where one or more signals privately sent by a sender to the receivers may be leaked. We study the design of leakage-robust persuasion schemes and quantify the price of robustness using two formalisms: - The first notion, -worst-case persuasiveness, requires a scheme to remain persuasive as long as each receiver observes at most leaked signals. We quantify the Price of Worst-case Robustness (PoWR) -- i.e., the gap in sender's utility as compared to the optimal private scheme -- as for supermodular sender utilities and for submodular or XOS utilities, where is the number of receivers. This result also establishes that in some instances,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Sensor Networks and Detection Algorithms
