Fair Cake-Cutting in Practice

10/18/2018
by   Maria Kyropoulou, et al.
0

Using a lab experiment, we investigate the real-life performance of envy-free and proportional cake-cutting procedures with respect to fairness and preference manipulation. We find that envy-free procedures, in particular Selfridge-Conway and the symmetric and asymmetric versions of cut-and-choose, are fairer and also are perceived as fairer than their proportional counterparts, despite the fact that agents very often manipulate them. Our results support the practical use of these procedures, and more generally, of envy-free cake-cutting mechanisms. We also find that subjects learn their opponents' preferences after repeated interaction and use this knowledge to improve their allocated share of the cake. Learning reduces truth-telling behavior and envy.

READ FULL TEXT

page 24

page 28

research
06/27/2011

Online Cake Cutting (published version)

We propose an online form of the cake cutting problem. This models situa...
research
04/15/2021

On Existence of Truthful Fair Cake Cutting Mechanisms

We study the fair division problem on divisible heterogeneous resources ...
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...
research
07/07/2017

Networked Fairness in Cake Cutting

We introduce a graphical framework for fair division in cake cutting, wh...
research
08/01/2022

Proportional Fair Division of Multi-layered Cakes

We study the multi-layered cake cutting problem, where the multi-layered...
research
12/12/2020

Mind the Gap: Cake Cutting With Separation

We study the problem of fairly allocating a divisible resource, also kno...
research
08/08/2021

Equivalence of Models of Cake-Cutting Protocols

The cake-cutting problem involves dividing a heterogeneous, divisible re...

Please sign up or login with your details

Forgot password? Click here to reset