Communication in dynastic repeated games: ‘Whitewashes’ and ‘coverups’
AbstractWe ask whether communication can directly substitute for memory in dynastic repeated games in which short lived individuals care about the utility of their offspring who replace them in an infinitely repeated game. Each individual is unable to observe what happens before his entry in the game. Past information is therefore conveyed from one cohort to the next by means of communication. When communication is costless and messages are sent simultaneously, communication mechanisms or protocols exist that sustain the same set of equilibrium payoffs as in the standard repeated game. When communication is costless but sequential, the incentives to “whitewash” the unobservable past history of play become pervasive. These incentives to whitewash can only be countered if some player serves as a “neutral historian” who verifies the truthfulness of others’ reports while remaining indifferent in the process. By contrast, when communication is sequential and (lexicographically) costly, all protocols admit only equilibria that sustain stage Nash equilibrium payoffs. We also analyze a centralized communication protocol in which history leaves a “footprint” that can only hidden by the current cohort by a unanimous “coverup.” We show that in this case the set of payoffs that are sustainable in equilibrium coincides with the weakly renegotiation proof payoffs of the standard repeated game. Copyright Springer-Verlag Berlin/Heidelberg 2005
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Economic Theory.
Volume (Year): 26 (2005)
Issue (Month): 2 (08)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm
Other versions of this item:
- Luca Anderlini & Roger Lagunoff, 2000. "Communication in Dynastic Repeated Games: `Whitewashes' and `Coverups," Working Papers gueconwpa~01-01-03, Georgetown University, Department of Economics, revised 01 Jul 2001.
- Luca Anderlini & Roger Lagunoff, 2001. " Communication in Dynastic Repeated Games: `Whitewashes' and `Coverups' ," Game Theory and Information 0107001, EconWPA.
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Guenther Eichhorn) or (Christopher F Baum).
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.