IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2510.25066.html
   My bibliography  Save this paper

Frequentist Persuasion

Author

Listed:
  • Arnav Sood
  • James Best

Abstract

A sender persuades a strategically naive decisionmaker (DM) by committing privately to an experiment. Sender's choice of experiment is unknown to the DM, who must form her posterior beliefs nonparametrically by applying some learning rule to an IID sample of (state, message) realizations. We show that, given mild regularity conditions, the empirical payoff functions hypo-converge to the full-information counterpart. This is sufficient to ensure that payoffs and optimal signals converge to the Bayesian benchmark. For finite sample sizes, the force of this "sampling friction" is nonmonotonic: it can induce more informative experiments than the Bayesian benchmark in settings like the classic Prosecutor-Judge game, and less revelation even in situations with perfectly aligned preferences. For many problems with state-independent preferences, we show that there is an optimal finite sample size for the DM. Although the DM would always prefer a larger sample for a fixed experiment, this result holds because the sample size affects sender's choice of experiment. Our results are robust to imperfectly informative feedback and the choice of learning rule.

Suggested Citation

  • Arnav Sood & James Best, 2025. "Frequentist Persuasion," Papers 2510.25066, arXiv.org, revised Nov 2025.
  • Handle: RePEc:arx:papers:2510.25066
    as

    Download full text from publisher

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

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2510.25066. 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.