Metraipolis › archive › dc_0d0da8972a98
Efficient approximately fair item allocation — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Efficient_approximately_fair_item_allocation
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T18:21:06.850Z
- SHA-256 of the archived text
930d6ef73be97a2db697bf345bde9a0347cefb4214cd230cc88efda6e67f55fb- Stable URL of this page
https://metraipolis.com/documento/dc_0d0da8972a98
How to cite
Efficient approximately fair item allocation — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Efficient_approximately_fair_item_allocation (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0d0da8972a98 (Metraipolis archive dc_0d0da8972a98, sha256 930d6ef73be97a2db697bf345bde9a0347cefb4214cd230cc88efda6e67f55fb)
BibTeX
@misc{dc0d0da8972a98,
title = {Efficient approximately fair item allocation — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Efficient_approximately_fair_item_allocation},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0d0da8972a98; sha256 930d6ef73be97a2db697bf345bde9a0347cefb4214cd230cc88efda6e67f55fb},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Efficient_approximately_fair_item_allocation. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
When allocating objects among people with different preferences, two major goals are Pareto efficiency and fairness. Since the objects are indivisible, there may not exist any fair allocation. For example, when there is a single house and 2 people, every allocation of the house will be unfair to 1 person. Therefore, several common approximations have been studied, such as maximin-share fairness (MMS), envy-freeness up to one item (EF1), proportionality up to one item (PROP1), and equitability up to one item (EQ1). The problem of efficient approximately fair item allocation is to find an allocation that is both Pareto-efficient (PE) and satisfies one of these fairness notions. The problem was first presented at 2016 and has attracted considerable attention since then. Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; ricerca «autonomous agent»). Fonte: Wikipedia in inglese, voce «Efficient approximately fair item allocation» — https://en.wikipedia.org/wiki/Efficient_approximately_fair_item_allocation Wikidata Q96377035 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q96377035 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Efficient_approximately_fair_item_allocation?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1375689223, consultata il 2026-10-15T17:50:46.861Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2c36f27898adf2f5542c329905395bab6e579561e3c22401d463a1e35a18adf3