Papers
Topics
Authors
Recent
Search
2000 character limit reached

Simultaneous EF1 and approximate MMS allocations for submodular valuations

Published 4 Jun 2026 in cs.GT | (2606.06451v1)

Abstract: There are two common classes of fairness notions that are considered when allocating mm indivisible items to nn agents of equal entitlements. One is that of share-based fairness notions, with the maximin share (MMS) and its relaxations to ρρ-MMS being prominent representatives of this class. The other is that of comparison-based fairness notions, with envy-freeness (EF) and its relaxations such as EF1 being prominent representatives of this class. In general, no class offers good guarantees for the other class. In this work, we design allocations that simultaneously satisfy notions from both classes, and specifically, are ρρ-MMS for constant ρρ and EF1 (in fact, also EFL). Such results were previously known when agents have additive valuations, and we prove such results for the more general class of submodular valuations.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.