Cumbersome coordination in repeated games
This paper examines the role communication between players might serve in enabling them to reach an agreement on the future play of a repeated game. The property of the communication process that we focus on is the amount of time it takes to complete. We characterize the effects of such communication processes indirectly by determining the set of agreements they may yield. A weak and a strong criterion are introduced to describe sets of agreements that are "stable" in the sense that players would follow the current agreement and not seek to reach a new agreement. We show that as players become extremely patient, strongly stable sets converge to Pareto efficient singletons. We apply the stability criteria to Prisoner's Dilemmas and show how the unique strongly stable set reflects asymmetries in the players' stage-game payoffs. Finally, we model the communication process as a Rubinstein alternating-offer bargaining game and demonstrate that the resulting agreements help characterize the strongly stable set for a general class of communication mechanisms.
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): 29 (2000)
Issue (Month): 1 ()
|Note:||Received January 1998/final version June 1999|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/182/PS2|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:29:y:2000:i:1:p:101-118. 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: (Sonal Shukla)or (Rebekah McClure)
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.