4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.GT2025
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
Masoud Seddighin, Saeed Seddighin
We study the problem of fair allocation of indivisible goods for subadditive agents. While constant-\textsf{MMS} bounds have been given for additive and fractionally subadditive ag…
cs.GT2023★ 4 cited
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations
Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin +1
We consider the problem of guaranteeing maximin-share (MMS) when allocating a set of indivisible items to a set of agents with fractionally subadditive (XOS) valuations. For XOS va…