# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### The Price of Anarchy on Uniformly Related Machines Revisited

##### Fulltext (public)

There are no public fulltexts stored in PuRe

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Epstein, L., & van Stee, R. (2008). The Price of Anarchy on Uniformly Related Machines
Revisited. In B. Monien, & U.-P. Schroeder (*Algorithmic
Game Theory* (pp. 46-57). Berlin: Springer. doi:10.1007/978-3-540-79309-0_6.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1D32-6

##### 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.
We consider scheduling on uniformly related machines.
Here 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.
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
of the fastest machine and the number of slow machines, and give
tight bounds for nearly all cases.