In the wikipedia page on envy-free cake cutting, continuous "moving knife" algorithms for envy free cake cutting to connected pieces is only mentioned for up to 4 players. As the wikipedia article does not say so explicitly, is there a general solution?
1 Answer
$\begingroup$
$\endgroup$
As far as I know, this is an open question. Some information can be found in:
Branzei and Nisan (2017), The Query Complexity of Cake Cutting.