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

Countervailing Curation Strategic Disclosure and the Design of Attention

Author

Listed:
  • Qian Cao
  • Yifei Sun

Abstract

Opposing advocates may be unable to fabricate evidence but can choose which true observations to present. We study how a court, editor, or platform should divide potential exposure between an advocate who prefers a higher decision and one who prefers a lower decision. Each advocate controls a separate evidence pool, exposure is committed before the state and evidence are known, and a selection-naive receiver averages displayed observations. Under baseline linear preferences and common knowledge of the realized pools, all Nash equilibria in every finite pool induce the same action and common disclosure bar: the upward advocate reveals observations above it and the downward advocate those below it. Attention therefore changes selection as well as weight. Under a common evidence law, more exposure makes an advocate speak less often and more extremely while moving the decision in its preferred direction. In large pools, the unique state-contingent exposure share that reproduces the complete-evidence decision balances the advocates' directional tail moments, not their observed speech. Because this share generally depends on the unknown state, we characterize the optimal ex ante compromise and solve a primitive two-state economy with a unique second-best policy. For finite pools, we derive the exact risk-minimizing adjustment, separating selection-induced cutoff bias, the receiver's fixed benchmark, and sampling variance. The attention-to-cutoff feedback survives partial weighting of empty slots and vanishes at full imputation.

Suggested Citation

  • Qian Cao & Yifei Sun, 2026. "Countervailing Curation Strategic Disclosure and the Design of Attention," Papers 2608.27903, arXiv.org.
  • Handle: RePEc:arx:papers:2608.27903
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.27903
    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:2608.27903. 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: https://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.