Minimax regret treatment rules with finite samples when a quantile is the object of interest
Patrik Guggenberger, Nihal Mehta, and Nikita Pavlov

TL;DR
This paper develops finite sample minimax regret treatment rules focusing on a specific quantile of outcomes, revealing conditions under which always treat or never treat are optimal, and extends to covariate inclusion.
Contribution
It introduces finite sample minimax regret treatment rules for quantile objectives, contrasting with expected utility maximization, and analyzes various sampling schemes and covariate effects.
Findings
Always treat or never treat are optimal under certain quantile conditions.
Optimal treatment rule depends on whether the quantile exceeds or is below 1/2.
Results extend to covariate-included scenarios.
Abstract
Consider a setup in which a decision maker is informed about the population by a finite sample and based on that sample has to decide whether or not to apply a certain treatment. We work out finite sample minimax regret treatment rules under various sampling schemes when outcomes are restricted onto the unit interval. In contrast to Stoye (2009) where the focus is on maximization of expected utility the focus here is instead on a particular quantile of the outcome distribution. We find that in the case where the sample consists of a fixed number of untreated and a fixed number of treated units, any treatment rule is minimax regret optimal. The same is true in the case of random treatment assignment in the sample with any assignment probability and in the case of testing an innovation when the known quantile of the untreated population equals 1/2. However if the known quantile exceeds…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Causal Inference Techniques · Game Theory and Voting Systems · Advanced Bandit Algorithms Research
