Optimal Envy-Free Cake Cutting

DSpace/Manakin Repository

Optimal Envy-Free Cake Cutting

Citable link to this page


Title: Optimal Envy-Free Cake Cutting
Author: Cohler, Yuga Julian; Lai, John Kwang; Parkes, David C.; Procaccia, Ariel

Note: Order does not necessarily reflect citation order of authors.

Citation: Cohler, Yuga, J., John K. Lai, David C. Parkes and Ariel D. Procaccia. Forthcoming. Optimal envy-free cake cutting. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011.
Full Text & Related Files:
Abstract: 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 each agent prefers its own allocation to any other, may not be efficient, in the sense of maximizing the total value of the agents. Our goal is to pinpoint the most efficient allocations among all envy-free allocations. We provide tractable algorithms for doing so under different assumptions regarding the preferences of the agents.
Other Sources: http://people.seas.harvard.edu/~arielpro/papers/maxsw.aaai11.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4892932
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search