Weighted EF1 Allocations for Indivisible Chores

Wu, Xiaowei; Cong, Zhang; Zhou, Shengwei

doi:10.1145/3580507.3597763

Cited by 7 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wu et al ( 2023) [65] proved that there exists a polynomial-time algorithm that computes WEF1 allocations for the allocation of chores to weighted agents, and there exists a polynomial-time algorithm that computes WEF1 and PO allocations for bivalued instances. The price of WEF1 is unbounded for three or more agents and is 4+α 4 for two agents, where α = max{w 1 ,w 2 } min{w 1 ,w 2 } .…”

Section: Hosseini Et Al (2023)mentioning

confidence: 99%

A Survey on Fair Allocation of Chores

Guo,

Li,

Deng

2023

Mathematics

View full text Add to dashboard Cite

Wherever there is group life, there has been a social division of labor and resource allocation, since ancient times. Examples include ant colonies, bee colonies, and wolf colonies. Different roles are responsible for different tasks. The same is true of human beings. Human beings are the largest social group in nature, among whom there are intricate social networks and interest networks between individuals. In such a complex relationship, how do decision makers allocate resources or tasks to individuals in a fair way? This is a topic worthy of further study. In recent decades, fair allocation has been at the core of research in economics, mathematics and other fields. The fair allocation problem is to assign a set of items to a set of agents so that each agent’s allocation is as fair as possible to satisfy each agent. The fairness measurements followed in current research include envy-freeness, proportionality, equitability, maximin share fairness, competitive equilibrium, maximum Nash social diswelfare, and so on. In this paper, the main concern is the allocation of chores. We discuss this problem in two parts: divisible and indivisible. We comprehensively review the existing results, algorithms, and approximations that meet various fairness criteria in chronological order. The relevant results of achieving fairness and efficiency are also discussed. In addition, we propose some open questions and future research directions for this problem based on existing research.

show abstract

Section: Hosseini Et Al (2023)mentioning

confidence: 99%