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

  • Authors:

  • Leah Epstein;Elena Kleiman;Rob Stee

  • Affiliations:

  • Department of Mathematics, University of Haifa, Haifa, Israel 31905;Department of Mathematics, University of Haifa, Haifa, Israel 31905;Max-Planck-Institut für Informatik, Saarbrücken, Germany 66123

  • Venue:
  • Journal of Combinatorial Optimization
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 s2, 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.