Cake cutting is a common metaphor for the division of a heterogeneous divisible good.
There are numerous papers that study the problem of fairly dividing a cake; a small number …

Imagine a cake that must be divided between a group of gluttonous children. To complicate
matters, the cake is heterogeneous: two pieces of cake may differ in terms of their top**s …

Cake cutting Page 1 78 CommuniCations of thE aCm | july 2013 | vol. 56 | no. 7 contributed
articles addressing some of the great challenges of the 21st century involves a thorough …

The existence of EFX allocations of goods is a major open problem in fair division, even for
additive valuations. The current state of the art is that no setting where EFX allocations are …

We consider the problem of fairly dividing a heterogeneous divisible good among agents
with different preferences. Previous work has shown that envy-free allocations, ie, where …

We revisit the classic problem of fair division from a mechanism design perspective and
provide an elegant truthful mechanism that yields surprisingly good approximation …

We study the fair division problem on divisible heterogeneous resources (the cake cutting
problem) with strategic agents, where each agent can manipulate his/her private valuation in …

We study the problem of designing truthful and fair mechanisms when allocating a mixture of
divisible and indivisible goods. We first show that there does not exist an EFM (envy-free for …

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 …

In the envy-free cake-cutting problem we are given a resource, usually called a cake and
represented as the 0,1 interval, and a set of n agents with heterogeneous preferences over …