Jump to ContentJump to Main Navigation
Repeated Games and ReputationsLong-Run Relationships$
Users without a subscription are not able to see the full content.

George J. Mailath and Larry Samuelson

Print publication date: 2006

Print ISBN-13: 9780195300796

Published to Oxford Scholarship Online: January 2007

DOI: 10.1093/acprof:oso/9780195300796.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 24 August 2019

 The Folk Theorem with Imperfect Public Monitoring

 The Folk Theorem with Imperfect Public Monitoring

Chapter:
(p.293) 9 The Folk Theorem with Imperfect Public Monitoring
Source:
Repeated Games and Reputations
Author(s):

George J. Mailath (Contributor Webpage)

Larry Samuelson (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780195300796.003.0009

This chapter shows that in many situations with patient players, the payoffs bounds from Chapter 8 are tight. It then proves various folk theorems for games of public monitoring, including games with a product structure and extensive form games. The chapter discusses the enforceability, identifiability, and rank conditions on the monitoring technology required for the folk theorem, and finally considers games of symmetric incomplete information.

Keywords:   enforceability, folk theorem, identifiability, product structure, public monitoring, rank conditions, symmetric incomplete information

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .