We consider the classic cake-division problem when the cake is a heterogeneous good represented by an interval in the real line. We provide a mechanism to implement, in an anonymous way, an envy-free and efficient allocation when agents have private information on their preferences. The...