DeepAI AI Chat
Log In Sign Up

Thou Shalt Covet The Average Of Thy Neighbors' Cakes

by   Jamie Tucker-Foltz, et al.

We prove an Ω(n^2) lower bound on the query complexity of local proportionality in the Robertson-Webb cake-cutting model. Local proportionality requires that each agent prefer their allocation to the average of their neighbors' allocations in some undirected social network. It is a weaker fairness notion than envy-freeness, which also has query complexity Ω(n^2), and generally incomparable to proportionality, which has query complexity Θ(n log n). This result separates the complexity of local proportionality from that of ordinary proportionality, confirming the intuition that finding a locally proportional allocation is a more difficult computational problem.


page 1

page 2

page 3

page 4


Fair Division via Social Comparison

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

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

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

A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees

We study the classic problem of fairly dividing a heterogeneous and divi...

On Fair Division with Binary Valuations Respecting Social Networks

We study the computational complexity of finding fair allocations of ind...

Networked Fairness in Cake Cutting

We introduce a graphical framework for fair division in cake cutting, wh...

Envy-Free Cake Cutting with Graph Constraints

We study the classic problem of fairly dividing a heterogeneous and divi...

Obvious Manipulations in Cake-Cutting

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