Multistage Communication With And Without Verifiable Types
We survey selected results on strategic information transmission. We distinguish between "cheap talk" and "persuasion". In the latter model, the informed player's message set depends on his type. As a benchmark, we first assume that the informed player sends a single message to the decision maker. We state characterization results for the sets of equilibrium payoffs, with and without verifiable types. We then show that multistage, bilateral communication enables the players to achieve new equilibrium outcomes, even if types are verifiable. We also propose complete characterizations of the equilibrium payoffs that are achievable with a bounded number of communication rounds.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 10 (2008)
Issue (Month): 02 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml|
|Order Information:|| Email: |
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.:
- Blume Andreas, 1994.
"Equilibrium Refinements in Sender-Receiver Games,"
Journal of Economic Theory,
Elsevier, vol. 64(1), pages 66-77, October.
- Blume, A., 1993. "Equilibrium Refinement in Sender-Receiver Games," Working Papers 93-06, University of Iowa, Department of Economics.
- Blume, A., 1991. "Equilibrium Refinement in Sender-Receiver Games," Working Papers 91-28, University of Iowa, Department of Economics.
- Blume, A., 1992. "Equilibrium Refinements in Sender-Receiver Games," Working Papers 92-12, University of Iowa, Department of Economics.
- Daniel J. Seidmann & Eyal Winter, 1997. "Strategic Information Transmission with Verifiable Messages," Econometrica, Econometric Society, vol. 65(1), pages 163-170, January.
- Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, March.
- Jérôme Renault, 2001. "3-player repeated games with lack of information on one side," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 221-245.
- repec:dau:papers:123456789/6109 is not listed on IDEAS
- V. Crawford & J. Sobel, 2010.
"Strategic Information Transmission,"
Levine's Working Paper Archive
544, David K. Levine.
- Watson, Joel, 1996. "Information Transmission When the Informed Party Is Confused," Games and Economic Behavior, Elsevier, vol. 12(1), pages 143-161, January.
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:10:y:2008:i:02:p:145-164. 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: (Tai Tone Lim)
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.