The Limits of AI-Driven Allocation: Optimal Screening under Aleatoric Uncertainty
Santiago Cortes-Gomez, Mateo Dulce Rubio, Carlos Patino, Bryan Wilder

TL;DR
This paper examines the fundamental limits of AI-driven resource allocation under irreducible uncertainty, proposing an optimal two-stage targeting strategy that combines screening and risk-based allocation.
Contribution
It introduces a theoretical framework for combining screening and algorithmic targeting, highlighting when they act as complements or substitutes under aleatoric uncertainty.
Findings
Optimal screening occurs at the margin of algorithmic allocation.
Directly targeting high-risk units maximizes efficiency.
Screening benefits increase with higher aleatoric uncertainty.
Abstract
The rise of machine learning has shifted targeted resource allocation in policy and humanitarian settings toward algorithmic targeting based on predicted risk scores. This approach is typically cheaper and faster than traditional screening procedures that directly observe the latent vulnerability status through physical verification. Yet, even access to the true conditional vulnerability probability cannot eliminate misallocation: aleatoric uncertainty over individual vulnerability status is irreducible, and probabilistic targeting inevitably misallocates some resources. In this work we study how screening and algorithmic targeting should be optimally combined in a two-stage allocation framework where a screening stage observes true outcomes for a subset of units before a final allocation stage assigns the resource under a fixed coverage budget. We show that the optimal strategy screens…
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.
