• DocumentCode
    2914194
  • Title

    Balanced Allocations of Cake

  • Author

    Edmonds, Jeff ; Pruhs, Kirk

  • Author_Institution
    Dept. of Comput. Sci. & Eng., York Univ., Toronto, Ont.
  • fYear
    2006
  • fDate
    Oct. 2006
  • Firstpage
    623
  • Lastpage
    634
  • Abstract
    We give a randomized algorithm for the well known caking cutting problem that achieves approximate fairness, and has complexity O(n), when all players are honest. The heart of this result involves extending the standard offline multiple-choice balls and bins analysis to the case where the underlying resources/bins/machines have different utilities to different players/balls/jobs
  • Keywords
    approximation theory; bin packing; computational complexity; game theory; randomised algorithms; bins analysis; caking cutting problem; fair approximation; offline multiple-choice balls analysis; randomized algorithm; Algorithm design and analysis; Books; Computer science; Heart; Kirk field collapse effect; Mathematics; Protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2006. FOCS '06. 47th Annual IEEE Symposium on
  • Conference_Location
    Berkeley, CA
  • ISSN
    0272-5428
  • Print_ISBN
    0-7695-2720-5
  • Type

    conf

  • DOI
    10.1109/FOCS.2006.17
  • Filename
    4031397
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2914194