Optimal Treatment Allocation under Constraints
Torben S. D. Johansen

TL;DR
This paper introduces an efficient algorithm for optimal multi-arm treatment allocation under constraints, capable of handling arbitrary outcomes and improving resource distribution based on causal estimates.
Contribution
It presents a polynomial-time algorithm for optimal treatment allocation with constraints and a method for Pareto-improving re-allocations, demonstrated on a real-world healthcare dataset.
Findings
Optimal allocation could increase yearly earnings by USD 1,815.
Re-allocating nurses could extend children's education by two months.
The algorithm handles arbitrary outcomes and constraints efficiently.
Abstract
In optimal policy problems where treatment effects vary at the individual level, optimally allocating treatments to recipients is complex even when potential outcomes are known. We present an algorithm for multi-arm treatment allocation problems that is guaranteed to find the optimal allocation in strongly polynomial time, and which is able to handle arbitrary potential outcomes as well as constraints on treatment requirement and capacity. Further, starting from an arbitrary allocation, we show how to optimally re-allocate treatments in a Pareto-improving manner. To showcase our results, we use data from Danish nurse home visiting for infants. We estimate nurse specific treatment effects for children born 1959-1967 in Copenhagen, comparing nurses against each other. We exploit random assignment of newborn children to nurses within a district to obtain causal estimates of nurse-specific…
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
TopicsField-Flow Fractionation Techniques
