IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2512.22987.html

Reputation and Disclosure in Dynamic Networks

Author

Listed:
  • I. Sebastian Buhai

Abstract

We develop a continuous-time model of reputational disclosure in directed networks of biased intermediaries with career concerns. A payoff-relevant fundamental follows a diffusion and a decision maker chooses actions to track it. Experts obtain verifiable signals that reach the decision maker only if relayed by intermediaries. Intermediaries choose whether to forward evidence and an observable disclosure clock that controls the arrival rate of disclosure opportunities. Because clocks are public, silence is state dependent: when the clock is on, delay is informative and reputationally costly; when it is off, silence is mechanically uninformative. Disclosure becomes a real option on reputational capital. Along any expert-decision maker path, Markov perfect Bayesian equilibria are ladder policies with finitely many posterior cutoffs, and clock-off windows eliminate knife-edge mixing. With sufficiently high reputational stakes and low discounting, dynamic incentives rule out persistent suppression and guarantee eventual transmission of all verifiable evidence along the path, even when bias reversals block static unraveling. We then study network design and formation. Absent the high-reputation regime, among trees exactly the bias-monotone ones sustain disclosure. Under homogeneous reputational intensities the bias-ordered line is dynamically optimal; with heterogeneous intensities, optimal design screens by topology, placing high-reputation intermediaries on direct parallel routes rather than in series. In an endogenous link-formation game, pairwise stable networks can be inefficiently sparse or redundantly dense because agents ignore the option-value externalities their links create or destroy for others' reputational assets.

Suggested Citation

  • I. Sebastian Buhai, 2025. "Reputation and Disclosure in Dynamic Networks," Papers 2512.22987, arXiv.org.
  • Handle: RePEc:arx:papers:2512.22987
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2512.22987
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    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:arx:papers:2512.22987. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.