Fair Allocation through Selective Information Acquisition
William Cai, Johann Gaebler, Nikhil Garg, Sharad Goel

TL;DR
This paper introduces an efficient algorithm for selective information screening to improve resource allocation fairness and utility under uncertainty, demonstrated on synthetic and real-world data.
Contribution
It formalizes the problem of targeted information acquisition as a series of linear programs, enhancing allocation fairness and efficiency.
Findings
Improves utility through targeted screening strategies.
Reduces disparities in resource allocation across groups.
Effective on both synthetic and real-world datasets.
Abstract
Public and private institutions must often allocate scare resources under uncertainty. Banks, for example, extend credit to loan applicants based in part on their estimated likelihood of repaying a loan. But when the quality of information differs across candidates (e.g., if some applicants lack traditional credit histories), common lending strategies can lead to disparities across groups. Here we consider a setting in which decision makers -- before allocating resources -- can choose to spend some of their limited budget further screening select individuals. We present a computationally efficient algorithm for deciding whom to screen that maximizes a standard measure of social welfare. Intuitively, decision makers should screen candidates on the margin, for whom the additional information could plausibly alter the allocation. We formalize this idea by showing the problem can be reduced…
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.
