Sciweavers

Share
ICALP
2007
Springer

Mechanism Design for Fractional Scheduling on Unrelated Machines

9 years 2 months ago
Mechanism Design for Fractional Scheduling on Unrelated Machines
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fractional truthful mechanism, while we propose a truthful mechanism that achieves approximation of 1 + (n − 1)/2, for n machines. We also focus on an interesting family of allocation algorithms, the task-independent algorithms. We give a lower bound of 1 + (n − 1)/2, that holds for every (not only monotone) allocation algorithm of this class. Under this consideration, our truthful independent mechanism is the best that we can hope from this family of algorithms.
George Christodoulou, Elias Koutsoupias, Annam&aac
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICALP
Authors George Christodoulou, Elias Koutsoupias, Annamária Kovács
Comments (0)
books