Under subjective divisibility, MMS approximation is 2/3-optimal for unary valuations, 5/9 in general, and 2/3 for up to four agents via new algorithms.
Procaccia, and Junxing Wang
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.GT 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Existence of EF1 and constant-ρ MMS allocations proven for submodular valuations.
A polynomial-time algorithm computes (φ-1)-approximate GMMS allocations for additive valuations, improving the prior 4/7 guarantee with tighter subinstance analysis.
citing papers explorer
-
Approximate Maximin Share with Subjective Divisibility: Beating the 1/2 Barrier
Under subjective divisibility, MMS approximation is 2/3-optimal for unary valuations, 5/9 in general, and 2/3 for up to four agents via new algorithms.
-
Simultaneous EF1 and approximate MMS allocations for submodular valuations
Existence of EF1 and constant-ρ MMS allocations proven for submodular valuations.
-
Improved Approximation Guarantees for Groupwise Maximin Share Fairness
A polynomial-time algorithm computes (φ-1)-approximate GMMS allocations for additive valuations, improving the prior 4/7 guarantee with tighter subinstance analysis.