Is there a bounded-time algorithm for Envy-free cake-cutting?
A bounded-time algorithm for the problem has been presented by Haris Aziz and Simon Mackenzie (A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents, arXiv:1604.03655, April 2016).