Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
