Dynamic sender–receiver games
We consider a dynamic version of sender–receiver games, where the sequence of states follows an irreducible Markov chain observed by the sender. Under mild assumptions, we provide a simple characterization of the limit set of equilibrium payoffs, as players become very patient. Under these assumptions, the limit set depends on the Markov chain only through its invariant measure. The (limit) equilibrium payoffs are the feasible payoffs that satisfy an individual rationality condition for the receiver, and an incentive compatibility condition for the sender.
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.
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.:
- Mehmet Ekmekci & Olivier Gossner & Andrea Wilson, 2010.
"Impermanent Types and Permanent Reputations,"
1511, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Vijay Krishna & John Morgan, 1999.
"A Model of Expertise,"
154, Princeton University, Woodrow Wilson School of Public and International Affairs, Discussion Papers in Economics..
- Mailath, George J. & Samuelson, Larry, 2006. "Repeated Games and Reputations: Long-Run Relationships," OUP Catalogue, Oxford University Press, number 9780195300796.
- Phelan, Christopher, 2006. "Public trust and government betrayal," Journal of Economic Theory, Elsevier, vol. 130(1), pages 27-43, September.
- Thomas Wiseman, 2006.
"Reputation and Impermanent Types,"
2006 Meeting Papers
650, Society for Economic Dynamics.
- D. Fudenberg & D. K. Levine, 1994.
"Efficiency and Observability with Long-Run and Short-Run Players,"
Levine's Working Paper Archive
627, David K. Levine.
- Fudenberg Drew & Levine David K., 1994. "Efficiency and Observability with Long-Run and Short-Run Players," Journal of Economic Theory, Elsevier, vol. 62(1), pages 103-135, February.
- Levine, David & Fudenberg, Drew, 1994. "Efficiency and Observability with Long-Run and Short-Run Players," Scholarly Articles 3203774, Harvard University Department of Economics.
- Drew Fudenberg & David K Levine, 1999. "Efficiency and Observability with Long-Run and Short-Run Players," Levine's Working Paper Archive 81, David K. Levine.
- Fudenberg, D. & Levine, D.K., 1991. "Efficiency and Obsevability with Long-Run and Short-Run Players," Working papers 591, Massachusetts Institute of Technology (MIT), Department of Economics.
- Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, June.
- Susan Athey & Kyle Bagwell, 2007.
"Collusion with Persistent Cost Shocks,"
321307000000000898, UCLA Department of Economics.
- Vijay Krishna & John Morgan, 2005.
"Contracting for Information under Imperfect Commitment,"
- Vijay Krishna & John Morgan, 2008. "Contracting for information under imperfect commitment," RAND Journal of Economics, RAND Corporation, vol. 39(4), pages 905-925.
- Krishna, Vijay & Morgan, John, 2004. "Contracting for Information under Imperfect Commitment," Competition Policy Center, Working Paper Series qt4010c6w9, Competition Policy Center, Institute for Business and Economic Research, UC Berkeley.
- V. Crawford & J. Sobel, 2010.
"Strategic Information Transmission,"
Levine's Working Paper Archive
544, David K. Levine.
- Robert J. Aumann & Sergiu Hart, 2003.
"Long Cheap Talk,"
Econometric Society, vol. 71(6), pages 1619-1660, November.
- Joseph Farrell & Matthew Rabin, 1996. "Cheap Talk," Journal of Economic Perspectives, American Economic Association, vol. 10(3), pages 103-118, Summer.
- Johannes Hörner & Takuo Sugaya & Satoru Takahashi & Nicolas Vieille, 2011. "Recursive Methods in Discounted Stochastic Games: An Algorithm for δ→ 1 and a Folk Theorem," Econometrica, Econometric Society, vol. 79(4), pages 1277-1318, 07.
- Besanko, David, 1985. "Multi-period contracts between principal and agent with adverse selection," Economics Letters, Elsevier, vol. 17(1-2), pages 33-37.
- Matthew O Jackson & Hugo F Sonnenschein, 2007. "Overcoming Incentive Constraints by Linking Decisions -super-1," Econometrica, Econometric Society, vol. 75(1), pages 241-257, 01.
- Baron, David P. & Besanko, David, 1984. "Regulation and information in a continuing relationship," Information Economics and Policy, Elsevier, vol. 1(3), pages 267-302.
- Marco Battaglini, 2005.
"Long-Term Contracting with Markovian Consumers,"
American Economic Review,
American Economic Association, vol. 95(3), pages 637-658, June.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:148:y:2013:i:2:p:502-534. 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: (Zhang, Lei)
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.