Maël Le Treust
Mathieu Faure : mathieu.faure[at]univ-amu.fr
Gaëtan Fournier : gaetan.fournier[at]univ-amu.fr
We consider a Bayesian persuasion problem where the persuader and the decision maker communicate through an imperfect channel which has a fixed and limited number of messages and is subject to exogenous noise. Imperfect communication entails a loss of payoff for the persuader. We establish an upper bound on the payoffs the persuader can secure by communicating through the channel. We also show that the bound is tight: if the persuasion problem consists of a large number of independent copies of the same base problem, then the persuader can achieve this bound arbitrarily closely by using strategies which tie all the problems together. We characterize this optimal payoff as a function of the information-theoretic capacity of the communication channel.