Efficient Fair Division with Minimal Sharing: For Fixed , Sharing-Minimal Fair fPO Allocations Are Computable in Operations and NP-Hard at Polynomial DegeneracyResearch Paper
Fair division of divisible resources is usually solved by convex optimization or market equilibrium, and the resulting allocations typically split many objects among several agents. In practice splitting is costly: a house, a car or a work shift is shared only by co-ownership or time-sharing. Sandomirskiy and Segal-Halevi (arXiv:1908.01669v3, Operations…