Unified Fair Allocation of Goods and Chores via Copies
نویسندگان
چکیده
We consider fair allocation of indivisible items in a model with goods, chores, and copies, as unified framework for studying: (1) the existence EFX other solution concepts goods copies; (2) chores. establish tight relation between these issues via two conceptual contributions: First, refinement envy-based fairness notions that we term envy without commons (denoted WC when applied to EFX). Second, formal duality theorem relating host (refined) copies their demonstrate usefulness our result by using it characterize chores through dual environment, well prove special case leveled preferences over further study hierarchy among envy-freeness α -MMS guarantees, showing example any guarantees at least \(\frac{4}{11} \) copies.
منابع مشابه
Fair Allocation of Indivisible Goods
As introduced in Chapter 11 (Thomson, 2015), Fair Division refers to the general problem of fairly dividing a common resource among agents having different —and sometimes antagonistic— interests in the resource. But under this general term one can actually gather a cluster of very different problems, all calling for different solution concepts: after all, one can easily figure out that we canno...
متن کاملAlgorithms for Max-Min Share Fair Allocation of Indivisible Chores
We consider Max-min Share (MmS) fair allocations of indivisible chores (items with negative utilities). We show that allocation of chores and classical allocation of goods (items with positive utilities) have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa. We prove that an MmS allocation d...
متن کاملFair Allocation of Indivisible Public Goods
We consider the problem of fairly allocating indivisible public goods. We model the public goods as elements with feasibility constraints on what subsets of elements can be chosen, and assume that agents have additive utilities across elements. Our model generalizes existing frameworks such as fair public decision making and participatory budgeting. We study a groupwise fairness notion called t...
متن کاملMax-min fair allocation of indivisible goods
We consider the problem of fairly allocating a set of m indivisible goods to n agents, given the agents' utilities for each good. Fair allocations in this context are those maximizing the minimum utility received by any agent. We give hardness results and polynomial time approximation algorithms for several variants of this problem. Our main result is a bicriteria approximation in the model wit...
متن کاملGroupwise Maximin Fair Allocation of Indivisible Goods
We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically, maximin share is defined as the minimum utility that an agent can guarantee for herself when asked to partition the set of goods into n bundles such that the remaining (n− 1) agents pick ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM transactions on economics and computation
سال: 2023
ISSN: ['2167-8383', '2167-8375']
DOI: https://doi.org/10.1145/3618116