Title: Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
Abstract: Cake cutting is one of the most fundamental settings in fair division and mechanism design without money. It has applications in scheduling and multi-agent resource allocation. We focus on cake cutting with piecewise constant valuations and consider different levels of three fundamental goals in cake cutting: fairness, Pareto optimality, and strategyproofness. We present three desirable algorithms which have their relative merits in achieving these goals.