Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911109325258752 |
|---|---|
| author | Andersen, Martin Jupakkal Caragiannis, Ioannis Ipsen, Anders Bo Søltoft, Alexander |
| author_facet | Andersen, Martin Jupakkal Caragiannis, Ioannis Ipsen, Anders Bo Søltoft, Alexander |
| contents | Although approximate notions of envy-freeness-such as envy-freeness up to one good (EF1)-have been extensively studied for indivisible goods, the seemingly simpler fairness concept of proportionality up to one good (PROP1) has received far less attention. For additive valuations, every EF1 allocation is PROP1, and well-known algorithms such as Round-Robin and Envy-Cycle Elimination compute such allocations in polynomial time. PROP1 is also compatible with Pareto efficiency, as maximum Nash welfare allocations are EF1 and hence PROP1.
We ask whether these favorable properties extend to non-additive valuations. We study a broad class of allocation instances with {\em satiating goods}, where agents have non-negative valuation functions that need not be monotone, allowing for negative marginal values. We present the following results:
- EF1 implies PROP1 for submodular valuations over satiating goods, ensuring existence and efficient computation via Envy-Cycle Elimination for monotone submodular valuations;
- Round-robin computes a partial PROP1 allocation after the second-to-last round for satiating submodular goods and a complete PROP1 for monotone submodular valuations;
- PROP1 allocations for satiating subadditive goods can be computed in polynomial-time;
- Maximum Nash welfare allocations are PROP1 for monotone submodular goods, revealing yet another facet of their ``unreasonable fairness.'' |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_12453 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations Andersen, Martin Jupakkal Caragiannis, Ioannis Ipsen, Anders Bo Søltoft, Alexander Computer Science and Game Theory Data Structures and Algorithms Although approximate notions of envy-freeness-such as envy-freeness up to one good (EF1)-have been extensively studied for indivisible goods, the seemingly simpler fairness concept of proportionality up to one good (PROP1) has received far less attention. For additive valuations, every EF1 allocation is PROP1, and well-known algorithms such as Round-Robin and Envy-Cycle Elimination compute such allocations in polynomial time. PROP1 is also compatible with Pareto efficiency, as maximum Nash welfare allocations are EF1 and hence PROP1. We ask whether these favorable properties extend to non-additive valuations. We study a broad class of allocation instances with {\em satiating goods}, where agents have non-negative valuation functions that need not be monotone, allowing for negative marginal values. We present the following results: - EF1 implies PROP1 for submodular valuations over satiating goods, ensuring existence and efficient computation via Envy-Cycle Elimination for monotone submodular valuations; - Round-robin computes a partial PROP1 allocation after the second-to-last round for satiating submodular goods and a complete PROP1 for monotone submodular valuations; - PROP1 allocations for satiating subadditive goods can be computed in polynomial-time; - Maximum Nash welfare allocations are PROP1 for monotone submodular goods, revealing yet another facet of their ``unreasonable fairness.'' |
| title | Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations |
| topic | Computer Science and Game Theory Data Structures and Algorithms |
| url | https://arxiv.org/abs/2508.12453 |