An FPTAS for 7/9-Approximation to Maximin Share Allocations
Abstract
We present a new algorithm that achieves a 79-approximation for the maximin share (MMS) allocation of indivisible goods under additive valuations, improving the current best ratio of 1013 (Heidari et al., SODA 2026). Building on a new analytical framework, we further obtain an FPTAS that achieves a 79- approximation in 1 · poly(n,m) time. Compared with prior work (Heidari et al., SODA 2026), our algorithm is substantially simpler.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.