Finding maxmin allocations in cooperative and competitive fair division
Marco Dall'Aglio, Camilla Di Luca
TL;DR
This paper investigates bounds and algorithms for maxmin allocations of divisible goods in cooperative and competitive settings, providing a method to compute exact values with arbitrary precision.
Contribution
It introduces bounds and a subgradient algorithm for precise computation of maxmin allocations in both strategic contexts.
Findings
Derived upper and lower bounds for maxmin allocations.
Developed a subgradient algorithm for exact computation.
Applicable to both cooperative and competitive scenarios.
Abstract
We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.