A greedy algorithm achieves 0.4-approximation for submodular max-min allocation with identical valuations and yields the first constant upper bound on the configuration LP integrality gap.
Fair allocation of indivisible goods: Improvements and generalizations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Submodular Max-Min Allocation under Identical Valuations
A greedy algorithm achieves 0.4-approximation for submodular max-min allocation with identical valuations and yields the first constant upper bound on the configuration LP integrality gap.