Networked Fairness in Cake Cutting

by   Xiaohui Bei, et al.

We introduce a graphical framework for fair division in cake cutting, where comparisons between agents are limited by an underlying network structure. We generalize the classical fairness notions of envy-freeness and proportionality to this graphical setting. Given a simple undirected graph G, an allocation is envy-free on G if no agent envies any of her neighbor's share, and is proportional on G if every agent values her own share no less than the average among her neighbors, with respect to her own measure. These generalizations open new research directions in developing simple and efficient algorithms that can produce fair allocations under specific graph structures. On the algorithmic frontier, we first propose a moving-knife algorithm that outputs an envy-free allocation on trees. The algorithm is significantly simpler than the discrete and bounded envy-free algorithm recently designed by Aziz and Mackenzie for complete graphs. Next, we give a discrete and bounded algorithm for computing a proportional allocation on descendant graphs, a class of graphs by taking a rooted tree and connecting all its ancestor-descendant pairs.


page 1

page 2

page 3

page 4


Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

The classical cake cutting problem studies how to find fair allocations ...

Fair Division via Social Comparison

In the classical cake cutting problem, a resource must be divided among ...

Graphical Cake Cutting via Maximin Share

We study the recently introduced cake-cutting setting in which the cake ...

Obvious Manipulations in Cake-Cutting

In cake-cutting, strategy-proofness is a very costly requirement in term...

Fair Cake-Cutting in Practice

Using a lab experiment, we investigate the real-life performance of envy...

Thou Shalt Covet The Average Of Thy Neighbors' Cakes

We prove an Ω(n^2) lower bound on the query complexity of local proporti...

Mind the Gap: Cake Cutting With Separation

We study the problem of fairly allocating a divisible resource, also kno...

Please sign up or login with your details

Forgot password? Click here to reset