Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.23026 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911471634481152 |
|---|---|
| author | Bachmat, Eitan Navon, Inbal Livni |
| author_facet | Bachmat, Eitan Navon, Inbal Livni |
| contents | In recent years many important societal decisions are made by machine-learning algorithms, and many such important decisions have strict capacity limits, allowing resources to be allocated only to the highest utility individuals. For example, allocating physician appointments to the patients most likely to have some medical condition, or choosing which children will attend a special program. When performing such decisions, we consider both the prediction aspect of the decision and the resource allocation aspect. In this work we focus on the fairness of the decisions in such settings. The fairness aspect here is critical as the resources are limited, and allocating the resources to one individual leaves less resources for others. When the decision involves prediction together with the resource allocation, there is a risk that information gaps between different populations will lead to a very unbalanced allocation of resources.
We address settings by adapting definitions from resource allocation schemes, identifying connections between the algorithmic fairness definitions and resource allocation ones, and examining the trade-offs between fairness and utility. We analyze the price of enforcing the different fairness definitions compared to a strictly utility-based optimization of the predictor, and show that it can be unbounded. We introduce an adaptation of proportional fairness and show that it has a bounded price of fairness, indicating greater robustness, and propose a variant of equal opportunity that also has a bounded price of fairness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_23026 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Fairness in Limited Resources Settings Bachmat, Eitan Navon, Inbal Livni Computers and Society In recent years many important societal decisions are made by machine-learning algorithms, and many such important decisions have strict capacity limits, allowing resources to be allocated only to the highest utility individuals. For example, allocating physician appointments to the patients most likely to have some medical condition, or choosing which children will attend a special program. When performing such decisions, we consider both the prediction aspect of the decision and the resource allocation aspect. In this work we focus on the fairness of the decisions in such settings. The fairness aspect here is critical as the resources are limited, and allocating the resources to one individual leaves less resources for others. When the decision involves prediction together with the resource allocation, there is a risk that information gaps between different populations will lead to a very unbalanced allocation of resources. We address settings by adapting definitions from resource allocation schemes, identifying connections between the algorithmic fairness definitions and resource allocation ones, and examining the trade-offs between fairness and utility. We analyze the price of enforcing the different fairness definitions compared to a strictly utility-based optimization of the predictor, and show that it can be unbounded. We introduce an adaptation of proportional fairness and show that it has a bounded price of fairness, indicating greater robustness, and propose a variant of equal opportunity that also has a bounded price of fairness. |
| title | Fairness in Limited Resources Settings |
| topic | Computers and Society |
| url | https://arxiv.org/abs/2602.23026 |