Existence of EF1 and constant-ρ MMS allocations proven for submodular valuations.
On fair allocation of indivisible goods to submodular agents
3 Pith papers cite this work, alongside 4 external citations. Polarity classification is still indexing.
3
Pith papers citing it
4
external citations · external index
verdicts
UNVERDICTED 3representative citing papers
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.
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
-
Simultaneous EF1 and approximate MMS allocations for submodular valuations
Existence of EF1 and constant-ρ MMS allocations proven for submodular valuations.
-
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.