Persuasion and Limited Communication
This paper studies optimal persuasion. A speaker must decide which arguments to present and a listener which arguments to accept. Communication is limited in that the arguments available to the speaker depend on her information. Optimality is assessed from the listener's perspective assuming that the listener can commit to a persuasion rule. I show that this seemingly simple scenario--introduced by Glazer and Rubinstein (2006)--is computationally intractable (formally, NP-hard). However under the assumption known as normality, which validates the revelation principle in mechanism design environments with evidence (Green and Laffont 1986, Bull and Watson 2007), I show that the persuasion problem reduces to a classic optimization problem, leading to a simple procedure for its solution. This procedure finds not only the optimal rule, but also the credible implementation of the optimal rule, i.e., the equilibrium of the game without commitment leading to the same outcome as the optimal rule. Normality also has qualitative consequences for the optimal rule. In particular, under normality, there always exists an optimal rule which is symmetric: i.e., ex ante equivalent evidence is treated equivalently. When normality fails, all optimal rules may be asymmetric; in other words, the listener may categorize evidence in an arbitrary manner, and base his decisions on these categories in order to influence the speaker's reporting behavior.
(This abstract was borrowed from another version of this item.)
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- H.S. Shin, 1994. "News Management and the Value of Firms," RAND Journal of Economics, The RAND Corporation, vol. 25(1), pages 58-71, Spring.
When requesting a correction, please mention this item's handle: RePEc:cla:levrem:122247000000002132. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David K. Levine)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.