Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Fair division of indivisible goods: Recent progress and open questions
Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …
times, with most of the early mathematical work on the problem focusing on resources that …
Fair division of indivisible goods: A survey
Allocating resources to individuals in a fair manner has been a topic of interest since the
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
[HTML][HTML] A survey on fair allocation of chores
H Guo, W Li, B Deng - Mathematics, 2023 - mdpi.com
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 …
allocation, since ancient times. Examples include ant colonies, bee colonies, and wolf …
Algorithmic fair allocation of indivisible items: A survey and new questions
The theory of algorithmic fair allocation is at the center of multi-agent systems and
economics in recent decades due to its industrial and social importance. At a high level, the …
economics in recent decades due to its industrial and social importance. At a high level, the …
Mixed fair division: A survey
Fair division considers the allocation of scarce resources among agents in such a way that
every agent gets a fair share. It is a fundamental problem in society and has received …
every agent gets a fair share. It is a fundamental problem in society and has received …
Weighted EF1 allocations for indivisible chores
We study how to fairly allocate a set of indivisible chores to a group of agents, where each
agent $ i $ has a non-negative weight $ w_i $ that represents its obligation for undertaking …
agent $ i $ has a non-negative weight $ w_i $ that represents its obligation for undertaking …
Approximately EFX allocations for indivisible chores
In this paper, we study how to fairly allocate a set of m indivisible chores to a group of n
agents, each of which has a general additive cost function on the items. Since envy-free (EF) …
agents, each of which has a general additive cost function on the items. Since envy-free (EF) …
Fair allocation of two types of chores
We consider the problem of fair allocation of indivisible chores under additive valuations. We
assume that the chores are divided into two types and under this scenario, we present …
assume that the chores are divided into two types and under this scenario, we present …
Fairly dividing mixtures of goods and chores under lexicographic preferences
We study fair allocation of indivisible goods and chores among agents with\emph
{lexicographic} preferences--a subclass of additive valuations. In sharp contrast to the goods …
{lexicographic} preferences--a subclass of additive valuations. In sharp contrast to the goods …
Weighted EF1 and PO allocations with few types of agents or chores
We investigate the existence of fair and efficient allocations of indivisible chores to
asymmetric agents who have unequal entitlements or weights. We consider the fairness …
asymmetric agents who have unequal entitlements or weights. We consider the fairness …