An approximation scheme for cake division with a linear number of cuts

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    5 Citations (Scopus)

    Abstract

    In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player gets a ‘fair’ share of the cake by his own measure. We prove the following result: For every ¿>0, there exists a cake division scheme for n players that uses at most c ¿n cuts, and in which each player can enforce to get a share of at least (1-¿)/nof the cake according to his own private measure
    Original languageEnglish
    Title of host publicationAlgorithms - ESA 2002 (Proceedings of the 10th Annual European Symposium, Rome, Italy, September 17-21, 2002)
    Place of PublicationBerlin
    PublisherSpringer
    Pages896-901
    ISBN (Print)978-3-540-44180-9
    DOIs
    Publication statusPublished - 2002

    Publication series

    NameLecture Notes in Computer Science
    Volume2461
    ISSN (Print)0302-9743

    Cite this