loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
Balanced Allocations of Cake
Berkeley, California
October 21-October 24
ISBN: 0-7695-2720-5
ASCII Text
x 
 
Jeff Edmonds, Kirk Pruhs, "Balanced Allocations of Cake," Foundations of Computer Science, IEEE Annual Symposium on, pp. 623-634, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/FOCS.2006.17,
author = {Jeff Edmonds and Kirk Pruhs},
title = {Balanced Allocations of Cake},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {2006},
issn = {0272-5428},
pages = {623-634},
doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.17},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Balanced Allocations of Cake
SN - 0272-5428
SP623
EP634
A1 - Jeff Edmonds,
A1 - Kirk Pruhs,
PY - 2006
KW - null
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Jeff Edmonds, York University, Canada
Kirk Pruhs, University of Pittsburgh, USA
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.
Citation:
Jeff Edmonds, Kirk Pruhs, "Balanced Allocations of Cake," focs, pp.623-634, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.