For subadditive valuations, an allocation always exists in which each of n agents receives at least 1/O((log log n)^2) of her maximin share, improving the previous 1/O(log n log log n) bound.
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
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
-
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
For subadditive valuations, an allocation always exists in which each of n agents receives at least 1/O((log log n)^2) of her maximin share, improving the previous 1/O(log n log log n) bound.