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

Robust Bayes Treatment Choice with Partial Identification

Author

Listed:
  • Andr'es Aradillas Fern'andez
  • Jos'e Luis Montiel Olea
  • Chen Qiu
  • Jorg Stoye
  • Serdil Tinda

Abstract

We study a class of binary treatment choice problems with partial identification, through the lens of robust (multiple prior) Bayesian analysis. We use a convenient set of prior distributions to derive ex-ante and ex-post robust Bayes decision rules, both for decision makers who can randomize and for decision makers who cannot. Our main messages are as follows: First, ex-ante and ex-post robust Bayes decision rules do not tend to agree in general, whether or not randomized rules are allowed. Second, randomized treatment assignment for some data realizations can be optimal in both ex-ante and, perhaps more surprisingly, ex-post problems. Therefore, it is usually with loss of generality to exclude randomized rules from consideration, even when regret is evaluated ex-post. We apply our results to a stylized problem where a policy maker uses experimental data to choose whether to implement a new policy in a population of interest, but is concerned about the external validity of the experiment at hand (Stoye, 2012); and to the aggregation of data generated by multiple randomized control trials in different sites to make a policy choice in a population for which no experimental data are available (Manski, 2020; Ishihara and Kitagawa, 2021).

Suggested Citation

  • Andr'es Aradillas Fern'andez & Jos'e Luis Montiel Olea & Chen Qiu & Jorg Stoye & Serdil Tinda, 2024. "Robust Bayes Treatment Choice with Partial Identification," Papers 2408.11621, arXiv.org.
  • Handle: RePEc:arx:papers:2408.11621
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Stoye, Jörg, 2007. "Minimax Regret Treatment Choice With Incomplete Data And Many Treatments," Econometric Theory, Cambridge University Press, vol. 23(1), pages 190-199, February.
    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. Tetenov, Aleksey, 2012. "Statistical treatment choice based on asymmetric minimax regret criteria," Journal of Econometrics, Elsevier, vol. 166(1), pages 157-165.
    2. Undral Byambadalai, 2022. "Identification and Inference for Welfare Gains without Unconfoundedness," Papers 2207.04314, arXiv.org.
    3. Stoye, Jörg, 2009. "Minimax regret treatment choice with finite samples," Journal of Econometrics, Elsevier, vol. 151(1), pages 70-81, July.
    4. Neil Christy & Amanda Ellen Kowalski, 2024. "Counting Defiers in Health Care: A Design-Based Model of an Experiment Can Reveal Evidence Against Monotonicity," Papers 2412.16352, arXiv.org, revised Mar 2025.
    5. Stoye, Jörg, 2012. "Minimax regret treatment choice with covariates or with limited validity of experiments," Journal of Econometrics, Elsevier, vol. 166(1), pages 138-156.
    6. Matthew A. Masten, 2023. "Minimax-regret treatment rules with many treatments," The Japanese Economic Review, Springer, vol. 74(4), pages 501-537, October.
    7. Stoye, Jörg, 2011. "Axioms for minimax regret choice correspondences," Journal of Economic Theory, Elsevier, vol. 146(6), pages 2226-2251.
    8. Iverson, Terrence, 2013. "Minimax regret discounting," Journal of Environmental Economics and Management, Elsevier, vol. 66(3), pages 598-608.

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