Two-player envy-free multi-cake division

@article{Cloutier2010TwoplayerEM,
  title={Two-player envy-free multi-cake division},
  author={J. Cloutier and Kathryn L. Nyman and F. Su},
  journal={Math. Soc. Sci.},
  year={2010},
  volume={59},
  pages={26-37}
}
  • J. Cloutier, Kathryn L. Nyman, F. Su
  • Published 2010
  • Mathematics, Computer Science
  • Math. Soc. Sci.
  • We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked preferences over the cakes. For two players, we show that disjoint envy-free piece selections may not exist for two cakes cut into two pieces each, and they may not exist for three cakes cut into three pieces each. However, there do exist such divisions for two… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Paper Mentions

    BLOG POST
    Envy-free two-player mm-cake and three-player two-cake divisions
    • 3
    • PDF
    Online Cake Cutting
    • T. Walsh
    • Computer Science, Mathematics
    • 2011
    • 54
    • PDF
    Algorithmic Solutions for Envy-Free Cake Cutting
    • 42
    • PDF
    Fair division with multiple pieces
    • 7
    • PDF
    Online Cake Cutting (published version)
    • 1
    Fair Division of Time: Multi-layered Cake Cutting
    • 1
    • PDF
    Nash-implementation of the no-envy solution on symmetric domains of economies
    • 5
    Nash-Implementation of the No-Envy Solution on Symmetric Domains of Economies
    Fair Division of an Archipelago
    • 2
    Computing and proving with pivots
    • 3
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 13 REFERENCES
    AN ENVY-FREE CAKE DIVISION PROTOCOL
    • 214
    • PDF
    Fair division - from cake-cutting to dispute resolution
    • 905
    • PDF
    Paradoxes of Fair Division
    • 34
    • PDF
    Cake-cutting algorithms - be fair if you can
    • 351
    • PDF
    Consensus-halving via theorems of Borsuk-Ulam and Tucker
    • 61
    • PDF
    A Polytopal Generalization of Sperner's Lemma
    • 43
    • PDF
    The Computation of Fixed Points and Applications
    • 367
    Un théorème d'existence
    • 32
    Computing Equilibria and Fixed Points
    • 64
    • PDF