Optimal Envy-Free Cake Cutting

  title={Optimal Envy-Free Cake Cutting},
  author={Yuga J. Cohler and John K. Lai and David C. Parkes and Ariel D. Procaccia},
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… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.

Similar Papers

Loading similar papers…