Sciweavers

276 search results - page 1 / 56
» Balanced Allocations of Cake
Sort
View
FOCS
2006
IEEE
13 years 10 months ago
Balanced Allocations of Cake
Jeff Edmonds, Kirk Pruhs
AAAI
2011
12 years 4 months ago
Optimal Envy-Free Cake Cutting
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...
Yuga J. Cohler, John K. Lai, David C. Parkes, Arie...
AAAI
2012
11 years 7 months ago
On Maxsum Fair Cake Divisions
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
Steven J. Brams, Michal Feldman, John K. Lai, Jami...
AAAI
2012
11 years 7 months ago
Optimal Proportional Cake Cutting with Connected Pieces
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...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
WINE
2010
Springer
213views Economy» more  WINE 2010»
13 years 2 months ago
The Efficiency of Fair Division with Connected Pieces
der the issue of fair division of goods, using the cake cutting abstraction, and aim to bound the possible degradation in social welfare due to the fairness requirements. Previous...
Yonatan Aumann, Yair Dombb