Scheduling selfish jobs on multidimensional parallel machines

Leah Epstein; Elena Kleiman

doi:10.1145/2612669.2612683

Scheduling selfish jobs on multidimensional parallel machines

Leah Epstein, Elena Kleiman

Department of Mathematics

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

Abstract

We study the multidimensional vector scheduling problem with selfish jobs, both in non-cooperative and in cooperative versions. We show existence of assignments that are Nash, strong Nash, weakly and strictly Pareto optimal Nash equilibria in these settings. We improve upon the previous bounds on the price of anarchy for the non-cooperative case, and find tight bounds for every number of machines and dimension. For the cooperative case we provide tight bounds on the strong prices of anarchy and stability, as well as tight bounds on weakly and strictly Pareto optimal prices of anarchy and stability, for every number of machines and dimension.

Original language	English
Title of host publication	SPAA 2014 - Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher	Association for Computing Machinery
Pages	108-117
Number of pages	10
ISBN (Print)	9781450328210
DOIs	https://doi.org/10.1145/2612669.2612683
State	Published - 2014
Event	26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014 - Prague, Czech Republic Duration: 23 Jun 2014 → 25 Jun 2014

Publication series

Name	Annual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference	26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014
Country/Territory	Czech Republic
City	Prague
Period	23/06/14 → 25/06/14

Keywords

Multidimensional scheduling
Parallel machines
Price of anarchy
Scheduling games

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture

Access to Document

10.1145/2612669.2612683

Cite this

@inproceedings{7be3ee6900cd469e958f1aaece8f7a41,

title = "Scheduling selfish jobs on multidimensional parallel machines",

abstract = "We study the multidimensional vector scheduling problem with selfish jobs, both in non-cooperative and in cooperative versions. We show existence of assignments that are Nash, strong Nash, weakly and strictly Pareto optimal Nash equilibria in these settings. We improve upon the previous bounds on the price of anarchy for the non-cooperative case, and find tight bounds for every number of machines and dimension. For the cooperative case we provide tight bounds on the strong prices of anarchy and stability, as well as tight bounds on weakly and strictly Pareto optimal prices of anarchy and stability, for every number of machines and dimension.",

keywords = "Multidimensional scheduling, Parallel machines, Price of anarchy, Scheduling games",

author = "Leah Epstein and Elena Kleiman",

year = "2014",

doi = "10.1145/2612669.2612683",

language = "English",

isbn = "9781450328210",

series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

publisher = "Association for Computing Machinery",

pages = "108--117",

booktitle = "SPAA 2014 - Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures",

note = "26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014 ; Conference date: 23-06-2014 Through 25-06-2014",

}

Epstein, L & Kleiman, E 2014, Scheduling selfish jobs on multidimensional parallel machines. in SPAA 2014 - Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures. Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, pp. 108-117, 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, Prague, Czech Republic, 23/06/14. https://doi.org/10.1145/2612669.2612683

Scheduling selfish jobs on multidimensional parallel machines. / Epstein, Leah; Kleiman, Elena.
SPAA 2014 - Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, 2014. p. 108-117 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

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

TY - GEN

T1 - Scheduling selfish jobs on multidimensional parallel machines

AU - Epstein, Leah

AU - Kleiman, Elena

PY - 2014

Y1 - 2014

N2 - We study the multidimensional vector scheduling problem with selfish jobs, both in non-cooperative and in cooperative versions. We show existence of assignments that are Nash, strong Nash, weakly and strictly Pareto optimal Nash equilibria in these settings. We improve upon the previous bounds on the price of anarchy for the non-cooperative case, and find tight bounds for every number of machines and dimension. For the cooperative case we provide tight bounds on the strong prices of anarchy and stability, as well as tight bounds on weakly and strictly Pareto optimal prices of anarchy and stability, for every number of machines and dimension.

AB - We study the multidimensional vector scheduling problem with selfish jobs, both in non-cooperative and in cooperative versions. We show existence of assignments that are Nash, strong Nash, weakly and strictly Pareto optimal Nash equilibria in these settings. We improve upon the previous bounds on the price of anarchy for the non-cooperative case, and find tight bounds for every number of machines and dimension. For the cooperative case we provide tight bounds on the strong prices of anarchy and stability, as well as tight bounds on weakly and strictly Pareto optimal prices of anarchy and stability, for every number of machines and dimension.

KW - Multidimensional scheduling

KW - Parallel machines

KW - Price of anarchy

KW - Scheduling games

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

U2 - 10.1145/2612669.2612683

DO - 10.1145/2612669.2612683

M3 - Conference contribution

AN - SCOPUS:84904473728

SN - 9781450328210

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 108

EP - 117

BT - SPAA 2014 - Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures

PB - Association for Computing Machinery

T2 - 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014

Y2 - 23 June 2014 through 25 June 2014

ER -

Scheduling selfish jobs on multidimensional parallel machines

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this