Fair division is hard even for amicable agents

DOI10.1007/978-3-030-67731-2_31zbMath1492.91160OpenAlexW3126594373MaRDI QIDQ831844

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

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

Related Items (1)

Efficient Fair Division with Minimal Sharing

Cites Work

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

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