Metraipolis › archive › dc_a24e2fe84286
Settling PROPm and PROPavg in Graphical Resource Allocation — arXiv:2610.10336
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10336
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T11:35:01.980Z
- SHA-256 of the archived text
50c8eba60860cb11a4034a8094b8602f20111b24138982e50522264efa2fd007- Stable URL of this page
https://metraipolis.com/documento/dc_a24e2fe84286
How to cite
Settling PROPm and PROPavg in Graphical Resource Allocation — arXiv:2610.10336 — arXiv (en), https://arxiv.org/abs/2610.10336 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a24e2fe84286 (Metraipolis archive dc_a24e2fe84286, sha256 50c8eba60860cb11a4034a8094b8602f20111b24138982e50522264efa2fd007)
BibTeX
@misc{dca24e2fe84286,
title = {Settling PROPm and PROPavg in Graphical Resource Allocation — arXiv:2610.10336},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10336},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a24e2fe84286; sha256 50c8eba60860cb11a4034a8094b8602f20111b24138982e50522264efa2fd007},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10336. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study proportional fairness in graphical resource allocation, where agents are vertices, indivisible items are edges, and each item must be allocated to one of its two endpoints. It has been proved that PROP1 orientations always exist and PROPx orientations may not, but it has remained open whether the intermediate relaxations PROPm and PROPavg (both can be satisfied without graphical constraints) can always be satisfied. In this paper, we resolve this gap. We prove that PROPm orientations always exist for goods on multigraphs and can be computed efficiently. The guarantee extends to chores and a mixture of goods and chores. In sharp contrast, we show that PROPavg orientations need not exist, even for simple graphs with binary valuations, and that deciding their existence is NP-complete. We further quantify the efficiency loss of PROPm: for goods, the price of PROPm is exactly $2$, which is one of the few settings where a constant bound on the price of fairness can be obtained. We complement these results with hardness results for welfare optimization under PROPm and for the existence of orientations that are simultaneously PROPm and Pareto optimal. Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno). Categorie arXiv: Computer Science and Game Theory (cs.GT). Pagina del lavoro: https://arxiv.org/abs/2610.10336 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T10:34:51.751Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).