The Community for Technology Leaders
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) (2006)
Berkeley, California
Oct. 21, 2006 to Oct. 24, 2006
ISSN: 0272-5428
ISBN: 0-7695-2720-5
pp: 623-634
Jeff Edmonds , York University, Canada
Kirk Pruhs , University of Pittsburgh, USA
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.
INDEX TERMS
null
CITATION

J. Edmonds and K. Pruhs, "Balanced Allocations of Cake," 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)(FOCS), Berkeley, California, 2006, pp. 623-634.
doi:10.1109/FOCS.2006.17
96 ms
(Ver 3.3 (11022016))