English

An FPTAS for 7/9-Approximation to Maximin Share Allocations

Computer Science and Game Theory 2025-11-18 v1 Data Structures and Algorithms

Abstract

We present a new algorithm that achieves a 79\frac{7}{9}-approximation for the maximin share (MMS) allocation of indivisible goods under additive valuations, improving the current best ratio of 1013\frac{10}{13} (Heidari et al., SODA 2026). Building on a new analytical framework, we further obtain an FPTAS that achieves a 79ε\frac{7}{9}-\varepsilon approximation in 1εpoly(n,m)\tfrac{1}{\varepsilon} \cdot \mathrm{poly}(n,m) time. Compared with prior work (Heidari et al., SODA 2026), our algorithm is substantially simpler.

Keywords

Cite

@article{arxiv.2511.13056,
  title  = {An FPTAS for 7/9-Approximation to Maximin Share Allocations},
  author = {Xin Huang and Shengwei Zhou},
  journal= {arXiv preprint arXiv:2511.13056},
  year   = {2025}
}

Comments

29 pages, 6 figures