For any fair division instance with monotone valuations, there exists an allocation with copies where each agent gets at least its maximin share, no good is copied more than O(log m) times, and total copies are at most m.
Algorithms for max-min share fair allocation of indivisible chores
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Exact Maximin Share Fairness via Adjusted Supply
For any fair division instance with monotone valuations, there exists an allocation with copies where each agent gets at least its maximin share, no good is copied more than O(log m) times, and total copies are at most m.