IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v122y2026ics0304406825001284.html

Information design and reputations in the frequent-interaction limit

Author

Listed:
  • Lillethun, Erik

Abstract

Consumer welfare may be higher when platforms sometimes conceal product quality information, because this can incentivize firms to invest more in quality. I study an infinite horizon model in which a long-run firm with a persistent type interacts with a sequence of short-run consumers. The focus is on the case where there are frequent consumer purchases. When a designer commits in advance to an information policy to maximize average consumer welfare, the approximately optimal policy and the resulting welfare depend on whether the policy may condition on the full history or only the publicly observable history. An approximately optimal full history policy approximates the upper bound welfare that is consistent with firm participation. It may do so by privately keeping track of a firm rating, threatening a hypothetical punishment (revealing firm type) off the path of play, while never giving consumers information on the path of play. However, learning must occur on the path of play in an approximately optimal public history policy. A public history policy can only achieve the upper bound welfare conditional on beliefs being above some cutoff. The approximately optimal public history policy features a learning cutoff: The firm must pass an initial test, driving beliefs up to the cutoff, which is essential for rewarding the firm.

Suggested Citation

  • Lillethun, Erik, 2026. "Information design and reputations in the frequent-interaction limit," Journal of Mathematical Economics, Elsevier, vol. 122(C).
  • Handle: RePEc:eee:mateco:v:122:y:2026:i:c:s0304406825001284
    DOI: 10.1016/j.jmateco.2025.103211
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406825001284
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jmateco.2025.103211?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:122:y:2026:i:c:s0304406825001284. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.