Venue:

Online, Tecent meeting ID: 691-125-654

Abstract:

The classic cake cutting problem concerns the fair allocation of a heterogeneous resource among interested agents. In this talk, we discuss a public goods variant of the problem, where instead of competing with one another for the cake, the agents all share the same subset of the cake which must be chosen subject to a length constraint. We focus on the design of truthful and fair mechanisms in the presence of strategic agents who have piecewise uniform utilities over the cake. We show that the leximin solution is truthful and moreover maximizes an egalitarian welfare measure among all truthful and position oblivious mechanisms.