Preemptive Scheduling on Selfish Machines

14 years 3 months ago

Download math.haifa.ac.il

We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimize the makespan, whereas the goal of the agents is to maximize their profit. We show that a known algorithm is monotone and can therefore be used to create a truthful mechanism for this problem which achieves the optimal makespan. We extend this result for additional common goal functions.

Leah Epstein, Rob van Stee

Real-time Traffic