Fair division of graphs and of tangled cakes

Fair division has been studied in both continuous and discrete contexts. One strand of the continuous literature seeks to award each agent with a single connected piece—a subinterval. The analogue for the discrete case corresponds to the fair division of a graph , where allocations must be contiguou...

Ausführliche Beschreibung