3 search results - page 1 / 1 » Optimal Envy-Free Cake Cutting |
AAAI
2011
12 years 10 months ago
2011
We consider the problem of fairly dividing a heterogeneous divisible good among agents with different preferences. Previous work has shown that envy-free allocations, i.e., where...
MFCS
2010
Springer
13 years 9 months ago
2010
Springer
This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta...
AAAI
2012
12 years 1 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...