On the Price of Anarchy of Restricted Job Scheduling Games
نویسندگان
چکیده
The Price of Anarchy [Koutspoupias and Papadimitriou, 1999] is the, by now celebrated, ratio used to measure how system performance is affected by the selfish behaviour of agents using it. In this work we show bounds on the Price of Anarchy for problems of restricted scheduling of selfish jobs on related and unrelated machines.
منابع مشابه
Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy
We study bottleneck congestion games where the social cost is determined by the worst congestion of any resource. These games directly relate to network routing problems and also job-shop scheduling problems. In typical bottleneck congestion games, the utility costs of the players are determined by the worst congested resources that they use. However, the resulting Nash equilibria are inefficie...
متن کاملCoordination Mechanisms for Selfish Scheduling
In machine scheduling, a set of n jobs must be scheduled on a set of m machines. Each job i incurs a processing time of pij on machine j and the goal is to schedule jobs so as to minimize some global objective function, such as the maximum makespan of the schedule considered in this paper. Often in practice, each job is controlled by an independent selfish agent who chooses to schedule his job ...
متن کاملCost-Sharing Scheduling Games on Restricted Unrelated Machines
We study a very general cost-sharing scheduling game. An instance consists of k jobs and m machines and an arbitrary weighted bipartite graph denoting the jobs strategies. An edge connecting a job and a machine specifies that the job may choose the machine; edge weights correspond to processing times. Each machine has an activation cost that needs to be covered by the job assigned to it. Jobs a...
متن کاملAnarchy without Stability
The price of anarchy is by now a standard measure for quantifying the inefficiency introduced in games due to selfish behavior, and is defined as the ratio between the optimal outcome and the worst Nash equilibrium. However, the price of anarchy is not even defined in games that admit no Nash equilibrium. We propose the dynamic inefficiency measure, which quantifies the average inefficiency int...
متن کاملDynamic Inefficiency: Anarchy without Stability
The price of anarchy [16] is by now a standard measure for quantifying the inefficiency introduced in games due to selfish behavior, and is defined as the ratio between the optimal outcome and the worst Nash equilibrium. However, this notion is well defined only for games that always possess a Nash equilibrium (NE). We propose the dynamic inefficiency measure, which is roughly defined as the av...
متن کامل