Abstract
Can cooperation be sustained in large populations? This paper studies settings in which a large group of players is rematched at random each period. In such settings cooperation cannot be sustained by an equilibrium unless deviators are sanctioned by third parties. This is known as the problem of community enforcement. Previous analyses have relied on strong assumptions about what information players have access to. This paper shows that when players are matched with multiple partners in each period, it is possible to limit the amount of information required to support cooperative outcomes. The results hold for general games and for equilibria that are robust to noise.
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.
