Balanced Allocations of Cake

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jan 2006Publisher:IEEEJournal:2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)

Authors: Jeff Edmonds; Kirk Pruhs;

doi: 10.1109/focs.2006.17

Balanced Allocations of Cake

- Summary
- Metrics

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.

Related Organizations

University of Pittsburgh
United States
York University
Canada

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	17
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average