142 research outputs found
Almost Group Envy-free Allocation of Indivisible Goods and Chores
We consider a multi-agent resource allocation setting in which an agent's
utility may decrease or increase when an item is allocated. We take the group
envy-freeness concept that is well-established in the literature and present
stronger and relaxed versions that are especially suitable for the allocation
of indivisible items. Of particular interest is a concept called group
envy-freeness up to one item (GEF1). We then present a clear taxonomy of the
fairness concepts. We study which fairness concepts guarantee the existence of
a fair allocation under which preference domain. For two natural classes of
additive utilities, we design polynomial-time algorithms to compute a GEF1
allocation. We also prove that checking whether a given allocation satisfies
GEF1 is coNP-complete when there are either only goods, only chores or both
Online Fair Division: A Survey
We survey a burgeoning and promising new research area that considers the
online nature of many practical fair division problems. We identify wide
variety of such online fair division problems, as well as discuss new
mechanisms and normative properties that apply to this online setting. The
online nature of such fair division problems provides both opportunities and
challenges such as the possibility to develop new online mechanisms as well as
the difficulty of dealing with an uncertain future.Comment: Accepted by the 34th AAAI Conference on Artificial Intelligence (AAAI
2020
Fair Allocation of goods and chores -- Tutorial and Survey of Recent Results
Fair resource allocation is an important problem in many real-world
scenarios, where resources such as goods and chores must be allocated among
agents. In this survey, we delve into the intricacies of fair allocation,
focusing specifically on the challenges associated with indivisible resources.
We define fairness and efficiency within this context and thoroughly survey
existential results, algorithms, and approximations that satisfy various
fairness criteria, including envyfreeness, proportionality, MMS, and their
relaxations. Additionally, we discuss algorithms that achieve fairness and
efficiency, such as Pareto Optimality and Utilitarian Welfare. We also study
the computational complexity of these algorithms, the likelihood of finding
fair allocations, and the price of fairness for each fairness notion. We also
cover mixed instances of indivisible and divisible items and investigate
different valuation and allocation settings. By summarizing the
state-of-the-art research, this survey provides valuable insights into fair
resource allocation of indivisible goods and chores, highlighting computational
complexities, fairness guarantees, and trade-offs between fairness and
efficiency. It serves as a foundation for future advancements in this vital
field
Random assignment with multi-unit demands
We consider the multi-unit random assignment problem in which agents express
preferences over objects and objects are allocated to agents randomly based on
the preferences. The most well-established preference relation to compare
random allocations of objects is stochastic dominance (SD) which also leads to
corresponding notions of envy-freeness, efficiency, and weak strategyproofness.
We show that there exists no rule that is anonymous, neutral, efficient and
weak strategyproof. For single-unit random assignment, we show that there
exists no rule that is anonymous, neutral, efficient and weak
group-strategyproof. We then study a generalization of the PS (probabilistic
serial) rule called multi-unit-eating PS and prove that multi-unit-eating PS
satisfies envy-freeness, weak strategyproofness, and unanimity.Comment: 17 page
- …