Fair allocations with subadditive and XOS valuations
Abstract
We consider the problem of fair allocation of m indivisible goods to n agents with either subadditive or XOS valuations, in the arbitrary entitlement case. As fairness notions, we consider the anyprice share (APS) ex-post, and the maximum expectation share (MES) ex-ante. We observe that there are randomized allocations that ex-ante are at least 12-MES in the subadditive case and (1-1e)-MES in the XOS case. Our more difficult results concern ex-post guarantees. We show that (1 - o(1)) m m-APS allocations exist in the subadditive case, and 16-APS allocations exist in the XOS case. For the special case of equal entitlements, we show 417-APS allocations for XOS. Our results are the first for subadditive and XOS valuations in the arbitrary entitlement case, and also improve over the previous best results for the equal entitlement case.
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.