Fair-Share Allocations for Agents with Arbitrary Entitlements

Moshe Babaioff, Tomer Ezra, Uriel Feige

Research output: Contribution to journalArticlepeer-review

Abstract

We consider the problem of fair allocation of indivisible goods to n agents with no transfers. When agents have equal entitlements, the well-established notion of the maxi min share (MMS) serves as an attractive fairness criterion for which, to qualify as fair, an allocation needs to give every agent at least a substantial fraction of the agent's MMS. In this paper, we consider the case of arbitrary (unequal) entitlements. We explain shortcomings in previous attempts that extend the MMS to unequal entitlements. Our conceptual contribution is the introduction of a new notion of a share, the AnyPrice share (APS), that is appropriate for settings with arbitrary entitlements. Even for the equal entitlements case, this notion is new and satisfies APSPMMS, for which the inequality is sometimes strict. We present two equivalent definitions for the APS (one as a minimization problem, the other as a maximization problem) and provide comparisons between the APS and previous notions of fairness. Our main result concerns additive valuations and arbitrary entitlements, for which we provide a polynomial-time algorithm that gives every agent at least a 3 5 fraction of the
Original languageEnglish
Number of pages33
JournalMathematics of Operations Research
DOIs
StatePublished Online - 26 Oct 2023

Fingerprint

Dive into the research topics of 'Fair-Share Allocations for Agents with Arbitrary Entitlements'. Together they form a unique fingerprint.

Cite this