Resource-constrained Fairness
Sofie Goethals, Eoin Delaney, Brent Mittelstadt, Chris Russell
TL;DR
Resource-constrained fairness reframes fair decision-making as a budgeted allocation problem where positive predictions are a scarce resource. The authors formalize harms per group $H_g[c_w]$ and show that under a fixed global selection rate $r$, optimal fairness enforces equal harm across groups (leveling up), with a measurable cost relative to the unconstrained optimum. They derive upper bounds on the cost of fairness via label swaps and demonstrate that costs are bell-shaped with respect to $r$, complemented by empirical results across diverse datasets showing how resource level and the chosen fairness metric influence trade-offs. The work unifies leveling up, cost-of-fairness, and resource constraints to enable practical deployment of fair decision systems and discusses policy levers such as adjusting selection rates or resources.
Abstract
Access to resources strongly constrains the decisions we make. While we might wish to offer every student a scholarship, or schedule every patient for follow-up meetings with a specialist, limited resources mean that this is not possible. When deploying machine learning systems, these resource constraints are simply enforced by varying the threshold of a classifier. However, these finite resource limitations are disregarded by most existing tools for fair machine learning, which do not allow the specification of resource limitations and do not remain fair when varying thresholds. This makes them ill-suited for real-world deployment. Our research introduces the concept of "resource-constrained fairness" and quantifies the cost of fairness within this framework. We demonstrate that the level of available resources significantly influences this cost, a factor overlooked in previous evaluations.
