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 (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 27 February 2021

Modeling Reputations

Modeling Reputations

(p.567) 18 Modeling Reputations
Repeated Games and Reputations

George J. Mailath (Contributor Webpage)

Larry Samuelson (Contributor Webpage)

Oxford University Press

This chapter presents an alternative approach to reputations based on a long-lived player who endeavors to separate himself from an undesirable (or inept) type, in contrast to the traditional models based on pooling with desirable commitment types. The long-lived player faces a continuum of long-lived idiosyncratic players. The goal is a more flexible model in which reputations have the properties of productive assets, requiring investments to build and maintain. The chapter provides an extensive discussion of the relationship between this model and previous analyses, as well as bad reputations and the role of the market for reputations.

Keywords:   bad reputation, commitment types, idiosyncratic player, inept type, market for reputations, reputation, separating reputation

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 .