Sciweavers

AAAI
2012
12 years 2 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
2011
13 years 13 days 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...