New Algorithm Makes Fair Sharing of Goods Easier and Faster
This could lead to quicker, fairer splits of inheritance, divorce assets, or office perks.
The article presents a deterministic polynomial-time algorithm that allocates m indivisible goods among n agents with nonnegative additive valuations using O(n^5 log^2 m) value queries and guarantees envy-freeness up to one good (EF1). Concurrent work by Lin, Liu, Tao, and Zhou achieves O(n^8 log m) comparison queries, attaining the optimal O(log m) dependence on m for fixed n; each comparison query can be simulated using two value queries, so their bound also holds for value queries. The authors’ contributions are a much simpler algorithm and proofs, and polynomial-time computation.
- A new algorithm divides goods fairly so everyone is satisfied with their share, even if they don't get everything they want.
- It uses fewer questions about preferences, making it faster and more practical for real-world use.
- The method is simpler to implement, so it could be built into apps for splitting assets like inheritances or office resources.
Why It Matters
This could lead to apps that quickly and fairly divide assets, reducing conflicts in divorces, inheritances, and roommate splits.