English

Envy-Free Cake-Cutting among Families

Computer Science and Game Theory 2019-08-12 v2

Abstract

This paper extends the classic cake-cutting problem to a situation in which the "cake" is divided among families. Each piece of cake is owned and used simultaneously by all members of the family. A typical example of such a cake is land. We examine three ways to assess the fairness of such a division, based on the classic no-envy criterion: (a) Average envy-freeness means that for each family, the average value of its share (averaged over all family members) is weakly larger than the average value of any other share; (b) Unanimous envy-freeness means that in each family, each member values the family's share weakly more than any other share; (c) Democratic envy-freeness means that in each family, at least half the members value the family's share weakly more than any other share. We study each of these definitions from both an existential and a computational perspective.

Keywords

Cite

@article{arxiv.1607.01517,
  title  = {Envy-Free Cake-Cutting among Families},
  author = {Erel Segal-Halevi and Shmuel Nitzan},
  journal= {arXiv preprint arXiv:1607.01517},
  year   = {2019}
}

Comments

The paper is obsolete - it is subsumed by the paper "Fair Cake-Cutting among Families", arXiv:1510.03903