Journal Article
@Article
Artikel in Fachzeitschrift

Show entries of:

this year (2020) | last year (2019) | two years ago (2018) | Notes URL

Action:

login to update
Options:




Library Locked Library locked




Author, Editor(s)
Author(s):
Epstein, Leah
van Stee, Rob		dblp
dblp
Not MPG Author(s):
Epstein, Leah

BibTeX cite key*:

EpsSte12

Title

Title*:

The price of anarchy on uniformly related machines revisited

Journal

Journal Title*:

Information and Computation
Journal's URL:


Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

Elsevier
Publisher's URL:


Publisher's
Address:

Amsterdam
ISSN:

0890-5401

Vol, No, pp, Date

Volume*:

212
Number:


Publishing Date:

March 2012

Pages*:

37-54
Number of
VG Pages:

18

Page Start:

37
Page End:

54

Sequence Number:


DOI:

10.1016/j.ic.2012.01.005

Note, Abstract, ©

Note:


(LaTeX) Abstract:

Recent interest in Nash equilibria led to a study of the {\it
price of anarchy} (poa) and the {\it strong price of anarchy}
(spoa) for scheduling problems. The two
measures express the worst case ratio between the cost of an
equilibrium (a pure Nash equilibrium, and a strong equilibrium,
respectively) to the cost of a social optimum.

The atomic players are the jobs, and the delay of a job is the
completion time of the machine running it, also called the load
of this machine. The social goal is to minimize the maximum delay
of any job, while the selfish goal of each job is to minimize its
own delay, that is, the delay of the machine running it.

We consider scheduling on uniformly related machines. While
previous studies either consider identical speed machines or an
arbitrary number of speeds, focusing on the number of machines as
a parameter, we consider the situation in which the number of
different speeds is small. We reveal a linear dependence between
the number of speeds and the poa. For a set of machines of at
most $p$ speeds, the poa turns out to be exactly $p+1$. The
growth of the poa for large numbers of related machines is
therefore a direct result of the large number of potential speeds.
We further consider a well known structure of processors, where
all machines are of the same speed except for one possibly faster
machine. We investigate the poa as a function of both the speed
ratio between the fastest machine and the number of slow machines.

URL for the Abstract:


Categories,
Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Internal

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{EpsSte12,
AUTHOR = {Epstein, Leah and van Stee, Rob},
 TITLE = {The price of anarchy on uniformly related machines revisited},
 JOURNAL = {Information and Computation},
 PUBLISHER = {Elsevier},
 YEAR = {2012},
 VOLUME = {212},
 PAGES = {37--54},
 ADDRESS = {Amsterdam},
 MONTH = {March},
 ISBN = {0890-5401},
 DOI = {10.1016/j.ic.2012.01.005},
}

Entry last modified by Anja Becker, 02/01/2013
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]		Created
11/14/2012 11:37:18 AM
Revision
1.
0.


Editor
Anja Becker
Rob van Stee


Edit Date
01.02.2013 12:00:45
11/14/2012 11:37:18 AM