Preemptive scheduling on selfish machines

Leah Epstein, Rob Van Stee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationCombinatorial and Algorithmic Aspects of Networking - 4th Workshop, CAAN 2007, Revised Papers
PublisherSpringer Verlag
Number of pages14
ISBN (Print)3540772936, 9783540772934
StatePublished - 2007
Event4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007 - Halifax, Canada
Duration: 14 Aug 200714 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4852 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Preemptive scheduling on selfish machines'. Together they form a unique fingerprint.

Cite this