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

Valuing Winners: When and How to Correct for Selection Bias in Randomized Experiments

Author

Listed:
  • Ron Berman
  • Walter W. Zhang
  • Hangcheng Zhao

Abstract

Decision-makers often deploy the best-performing treatment from a randomized experiment, creating a winner's curse: selection favors treatments whose observed outcomes are high partly because of statistical noise, so the na\"ive estimate of the winner is upward biased. We distinguish two forms of winner's curse, bias relative to the true best treatment (global) and bias relative to the selected treatment's true mean (selective), and link them to regret from deploying a suboptimal treatment. This framework defines seven decision-relevant evaluation targets: mean bias, mean squared error, and confidence interval coverage for the global and selective winner's curse, and mean regret. We then show that methods that perform well on one target can perform poorly on others, so corrections should be matched to the manager's objective. Across simulations with varying effect sizes, multiple-arm settings, and data calibrated to an online A/B testing platform, no method dominates uniformly: the plug-in estimator performs best when treatment differences are large, cross-fitting performs best when treatments are similar, and resampling methods often achieve low mean squared error for moderate differences. We also introduce an adaptive empirical likelihood procedure that delivers asymptotically valid confidence intervals across settings without the tuning sensitivity of resampling-based methods.

Suggested Citation

  • Ron Berman & Walter W. Zhang & Hangcheng Zhao, 2026. "Valuing Winners: When and How to Correct for Selection Bias in Randomized Experiments," Papers 2605.18887, arXiv.org.
  • Handle: RePEc:arx:papers:2605.18887
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Song, Kyungchul, 2014. "Local asymptotic minimax estimation of nonregular parameters with translation-scale equivariant maps," Journal of Multivariate Analysis, Elsevier, vol. 125(C), pages 136-158.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hiroaki Kaido & Yi Zhang, 2019. "Robust Likelihood Ratio Tests for Incomplete Economic Models," Papers 1910.04610, arXiv.org, revised Dec 2019.
    2. Daido Kido, 2023. "Locally Asymptotically Minimax Statistical Treatment Rules Under Partial Identification," Papers 2311.08958, arXiv.org.
    3. Timothy B. Armstrong, 2014. "A Note on Minimax Testing and Confidence Intervals in Moment Inequality Models," Cowles Foundation Discussion Papers 1975, Cowles Foundation for Research in Economics, Yale University.
    4. Chen, Qihui & Fang, Zheng, 2019. "Inference on functionals under first order degeneracy," Journal of Econometrics, Elsevier, vol. 210(2), pages 459-481.
    5. Hong, Han & Li, Jessie, 2018. "The numerical delta method," Journal of Econometrics, Elsevier, vol. 206(2), pages 379-394.

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

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.