mc_journal_B_joco_sec_revision.pdf (494.57 kB)
Download file

The cost of selfishness for maximizing the minimum load on uniformly related machines

Download (494.57 kB)
journal contribution
posted on 20.04.2016, 09:17 by L. Epstein, E. Kleiman, Rob Van Stee
Consider the following scheduling game. A set of jobs, each controlled by a selfish agent, are to be assigned to m uniformly related machines. The cost of a job is defined as the total load of the machine that its job is assigned to. A job is interested in minimizing its cost, while the social objective is maximizing the minimum load (the value of the cover) over the machines. This goal is different from the regular makespan minimization goal, which was extensively studied in a game theoretic context. We study the price of anarchy (poa) and the price of stability (pos) for uniformly related machines. The results are expressed in terms of s, which is the maximum speed ratio between any two machines. For uniformly related machines, we prove that the pos is unbounded for s>2, and the poa is unbounded for s≥2. For the remaining cases we show that while the poa grows to infinity as s tends to 2, the pos is at most 2 for any s≤2. © 2012 Springer Science+Business Media New York.



Journal of Combinatorial Optimization, 2014, 27 (4), pp. 767-777

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science


AM (Accepted Manuscript)

Published in

Journal of Combinatorial Optimization


Springer US





Copyright date


Available date


Publisher version