Fair division is hard even for amicable agents

DOI10.1007/978-3-030-67731-2_31MaRDI QIDQ831844zbMATH OpenOpenAlexFDO

Authors Neeldhara Misra, Aditi Sethia

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-67731-2_31

zbMATH Keywords

NP-completenessfair divisionindivisible items

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Efficient Fair Division with Minimal Sharing
• Fair allocation of indivisible goods: the two-agent case
• Almost envy-freeness with general valuations
• Fair division with no information
• Fair enough: guaranteeing approximate maximin shares

Cites work

• A Little Charity Guarantees Almost Envy-Freeness
• Cake-cutting with different entitlements: how many cuts are needed?
• Deleting to structured trees

Cited in

(1)

• Efficient Fair Division with Minimal Sharing

This page was built for publication: Fair division is hard even for amicable agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831844)