Truth, justice, and cake cutting

► We consider cake cutting as a mechanism design problem. ► We examine the special case when agents have the same marginal value for all desired intervals. ► We give a direct-revelation mechanism that is dominant strategy incentive compatible, Pareto-efficient, proportional, envy-free, and computationally tractable. ► We consider randomized mechanisms and obtain similar results for more general valuations under a weaker notion of incentive compatibility.