Cake-Cutting with Different Entitlements: How Many Cuts are Needed?

03/14/2018
by   Erel Segal-Halevi, et al.
0

A cake has to be divided fairly among n agents. When all agents have equal entitlements, it is known that such a division can be implemented with n-1 cuts. When agents may have different entitlements, we show that at least 2 n -2 cuts may be necessary, and 2 n·Θ((n)) cuts are always sufficient.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2019

Disproportionate division

We study the disproportionate version of the classical cake-cutting prob...
research
09/03/2022

How to cut a discrete cake fairly

Cake-cutting is a fundamental model of dividing a heterogeneous resource...
research
11/09/2021

Cutting a Cake Is Not Always a "Piece of Cake": A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory

Cake-cutting is a playful name for the fair division of a heterogeneous,...
research
02/13/2022

Reduced-Form Allocations with Complementarity: A 2-Person Case

We investigate the implementation of reduced-form allocation probabiliti...
research
06/27/2011

Online Cake Cutting (published version)

We propose an online form of the cake cutting problem. This models situa...
research
10/30/2019

Dividing a Graphical Cake

We consider the classical cake-cutting problem where we wish to fairly d...
research
04/28/2020

Fair Division of Time: Multi-layered Cake Cutting

We initiate the study of multi-layered cake cutting with the goal of fai...

Please sign up or login with your details

Forgot password? Click here to reset