Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

CAAN
2007
Springer

favoriteEmaildiscussreport

144views Discrete Geometry» more CAAN 2007»

Preemptive Scheduling on Selfish Machines

13 years 8 months ago

Preemptive Scheduling on Selfish Machines

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

Additional Common Goal | CAAN 2007 | Discrete Geometry | Selfish Agents | Uniformly Related Machines |

claim paper

Related Content

» Optimal OnLine Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

» Preemptive Scheduling with Rejection

» Preemptive scheduling on a small number of hierarchical machines

» Online realtime preemptive scheduling of jobs with deadlines

» Optimal and Online Preemptive Scheduling on Uniformly Related Machines

» Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

» Preemptive MultiMachine Scheduling of EqualLength Jobs to Minimize the Average Flow Time

» Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines

» Preemptive Scheduling of EqualLength Jobs in Polynomial Time

Post Info
More Details (n/a)

Added	12 Aug 2010
Updated	12 Aug 2010
Type	Conference
Year	2007
Where	CAAN
Authors	Leah Epstein, Rob van Stee

Comments (0)