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: 20 October 2019

 Almost Public Monitoring Games

 Almost Public Monitoring Games

Chapter:
(p.415) 13 Almost Public Monitoring Games
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.0013

This chapter provides a detailed treatment of work on games with almost-public monitoring. The chapter introduces the key distinction between strategies with bounded and unbounded recall, showing that perfect public equilibria with bounded recall in public monitoring games induce equilibrium behavior in nearby private monitoring games, while equilibria with unbounded recall typically imply coordination failure in nearby private monitoring games. The chapter concludes with a folk theorem for games of almost-public monitoring.

Keywords:   almost-public monitoring, bounded recall, coordination failure, folk theorem, private monitoring

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 .