Preemptive scheduling on selfish machines

Leah Epstein; Rob Van Stee

doi:10.1007/978-3-540-77294-1_7

Preemptive scheduling on selfish machines

Leah Epstein, Rob Van Stee

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	English
Title of host publication	Combinatorial and Algorithmic Aspects of Networking - 4th Workshop, CAAN 2007, Revised Papers
Publisher	Springer Verlag
Pages	57-70
Number of pages	14
ISBN (Print)	3540772936, 9783540772934
DOIs	https://doi.org/10.1007/978-3-540-77294-1_7
State	Published - 2007
Event	4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007 - Halifax, Canada Duration: 14 Aug 2007 → 14 Aug 2007

Publication series

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

Conference

Conference	4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007
Country/Territory	Canada
City	Halifax
Period	14/08/07 → 14/08/07

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-77294-1_7

Cite this

Epstein, L., & Van Stee, R. (2007). Preemptive scheduling on selfish machines. In Combinatorial and Algorithmic Aspects of Networking - 4th Workshop, CAAN 2007, Revised Papers (pp. 57-70). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4852 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-77294-1_7

@inproceedings{24e8e1c214e74931bf3e1bcca08d13fd,

title = "Preemptive scheduling on selfish machines",

abstract = "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.",

author = "Leah Epstein and {Van Stee}, Rob",

year = "2007",

doi = "10.1007/978-3-540-77294-1_7",

language = "English",

isbn = "3540772936",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "57--70",

booktitle = "Combinatorial and Algorithmic Aspects of Networking - 4th Workshop, CAAN 2007, Revised Papers",

address = "Germany",

note = "4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007 ; Conference date: 14-08-2007 Through 14-08-2007",

}

Epstein, L & Van Stee, R 2007, Preemptive scheduling on selfish machines. in Combinatorial and Algorithmic Aspects of Networking - 4th Workshop, CAAN 2007, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4852 LNCS, Springer Verlag, pp. 57-70, 4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007, Halifax, Canada, 14/08/07. https://doi.org/10.1007/978-3-540-77294-1_7

Preemptive scheduling on selfish machines. / Epstein, Leah; Van Stee, Rob.
Combinatorial and Algorithmic Aspects of Networking - 4th Workshop, CAAN 2007, Revised Papers. Springer Verlag, 2007. p. 57-70 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4852 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Preemptive scheduling on selfish machines

AU - Epstein, Leah

AU - Van Stee, Rob

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38549175600&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-77294-1_7

DO - 10.1007/978-3-540-77294-1_7

M3 - Conference contribution

AN - SCOPUS:38549175600

SN - 3540772936

SN - 9783540772934

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 57

EP - 70

BT - Combinatorial and Algorithmic Aspects of Networking - 4th Workshop, CAAN 2007, Revised Papers

PB - Springer Verlag

T2 - 4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007

Y2 - 14 August 2007 through 14 August 2007

ER -

Preemptive scheduling on selfish machines

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this