On Cutting Cakes and Crossing Curves

Alexandros Hollender, Gilbert Maystre, Kilian Risse

We consider the classic envy-free cake-cutting problem where the goal is to cut and allocate a divisible resource among a set of agents in a way that avoids any envy between them.…