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 …
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱
In this paper, we study how to fairly allocate a set of indivisible chores to a number of
(asymmetric) agents with additive cost functions. We consider the fairness notion of …
(asymmetric) agents with additive cost functions. We consider the fairness notion of …
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) …
On best-of-both-worlds fair-share allocations
We consider the problem of fair allocation of indivisible items among n agents with additive
valuations, when agents have equal entitlements to the goods, and there are no transfers …
valuations, when agents have equal entitlements to the goods, and there are no transfers …
Tree splitting based rounding scheme for weighted proportional allocations with subsidy
We consider the problem of allocating $ m $ indivisible items to a set of $ n $ heterogeneous
agents, aiming at computing a proportional allocation by introducing subsidy (money). It has …
agents, aiming at computing a proportional allocation by introducing subsidy (money). It has …
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
a unified framework for studying:(1) the existence of EFX and other solution concepts for …
a unified framework for studying:(1) the existence of EFX and other solution concepts for …
On picking sequences for chores
We consider the problem of allocating m indivisible chores to n agents with additive
disvaluation (cost) functions. It is easy to show that there are picking sequences that give …
disvaluation (cost) functions. It is easy to show that there are picking sequences that give …