Optimal Decision Rules Under Partial Identification
Not on the map. Why?
Abstract (arXiv)
I consider a class of statistical decision problems in which the policymaker must decide between two policies to maximize social welfare (e.g., the population mean of an outcome) based on a finite sample. The framework introduced in this paper allows for various types of restrictions on the structural parameter (e.g., the smoothness of a conditional mean potential outcome function) and accommodates settings with partial identification of social welfare. As the main theoretical result, I derive a finite-sample optimal decision rule under the minimax regret criterion. This rule has a simple form, yet achieves optimality among all decision rules; no ad hoc restrictions are imposed on the class of decision rules. I apply my results to the problem of whether to change an eligibility cutoff in a regression discontinuity setup, and illustrate them in an empirical application to a school construction program in Burkina Faso.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Nov 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 2.
3 papers.
- 2023Bayesian Safe Policy Learning with Chance Constrained Optimization: Application to Military Security Assessment during the Vietnam Warcited by 4
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruningcited by 0
- 2026Same Winners, Different Success Rates: Evaluating How LLM Agents Recover from Failurescited by 0
- 2026Same Winners, Different Success Rates: Evaluating How LLM Agents Recover from Failures28 Sep 2026
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruning3 Aug 2026
- 2023Bayesian Safe Policy Learning with Chance Constrained Optimization: Application to Military Security Assessment during the Vietnam War17 Jul 2023