Finding fair and efficient allocations when valuations don't add up

DOI10.1007/978-3-030-57980-7_3zbMath1506.91066arXiv2003.07060OpenAlexW3012103574MaRDI QIDQ2109945

Mithun Chakraborty, Ayumi Igarashi, Nawal Benabbou, Yair Zick

Publication date: 21 December 2022

Full work available at URL: https://arxiv.org/abs/2003.07060

zbMATH Keywords

submodularityfair divisiondichotomous preferencesenvy-freenessmatroid rank functionsoptimal welfare

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (5)

Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ The price of fairness for indivisible goods

This page was built for publication: Finding fair and efficient allocations when valuations don't add up