Summary: In this paper, we study the scheduling game with machine activation costs. A set of jobs is to be processed on identical parallel machines. The number of machines available is unlimited, and an activation cost is needed whenever a machine is activated in order to process jobs. Each job chooses a machine on which it wants to be processed. The cost of a job is the sum of the load of the machine it chooses and its shared activated cost. The social cost is the total cost of all jobs. Representing PoA as a function of the number of jobs, we get the tight bound of PoA. Representing PoA as a function of the smallest processing time of jobs, improved lower and upper bound are also given.
For the entire collection see [Zbl 1294.68014].