Envy-Free Cake Cutting with Graph Constraints

Ganesh Ghalme, Xin Huang, Nidhi Rathi

We study the classic problem of fairly dividing a heterogeneous and divisible resource -- represented by a cake, $[0,1]$ -- among $n$ agents. This work considers an interesting var…