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.
On fair allocation of indivisible goods to submodular agents
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Presents positive and negative results on exact and approximate MMS and PMMS allocations for additive, XOS, and subadditive valuations in the graphical multi-graph model.
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.
-
Exact and approximate maximin share allocations in multi-graphs
Presents positive and negative results on exact and approximate MMS and PMMS allocations for additive, XOS, and subadditive valuations in the graphical multi-graph model.