The fair division literature in economics considers how to divide resources between multiple
agents such that the allocation is envy-free: each agent receives their favorite piece …

Fair division protocols specify how to split a continuous resource (conventionally
represented by a cake) between multiple agents with different preferences. Envy-free …

Spliddit: Unleashing Fair Division Algorithms Page 1 Spliddit: Unleashing Fair Division
Algorithms JONATHAN GOLDMAN and ARIEL D. PROCACCIA Carnegie Mellon University …

The goal of fair division is to distribute resources among competing players in a “fair" way.
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …

Fair division is a longstanding problem in economics and has recently received substantial
interest in computer science. Several applications of fair division involve agents with …

Envy-free cake-cutting protocols procedurally divide an infinitely divisible good among a set
of agents so that no agent prefers another's allocation to their own. These protocols are …

We consider the fair division problem of indivisible items. It is well-known that an envy-free
allocation may not exist, and a relaxed version of envy-freeness, envy-freeness up to one …

ACM: Digital Library: Communications of the ACM ACM Digital Library Communications of the
ACM Volume 63, Number 4 (2020), Pages 118-118 An answer to fair division's most …

We study the paradigmatic fair division problem of fairly allocating a divisible good among
agents with heterogeneous preferences, commonly known as cake cutting. Classic cake …

Fair division is a fundamental problem in economic theory and one of the oldest questions
faced through the history of human society. The high level scenario is that of several …