DeepAI AI Chat
Log In Sign Up

On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems

by   Eirini Georgoulaki, et al.

We study cost-sharing games in real-time scheduling systems where the activation cost of the server at any given time is a function of its load. We focus on monomial cost functions and consider both the case when the degree is less than one (inducing positive externalities for the jobs) and when it is greater than one (inducing negative externalities for the jobs). For the former case, we provide tight price of anarchy bounds which show that the price of anarchy grows to infinity as a polynomial of the number of jobs in the game. For the latter, we observe that existing results provide constant and tight (asymptotically in the degree of the monomial) bounds on the price of anarchy. We then switch our attention to improving the price of anarchy by means of a simple coordination mechanism that has no knowledge of the instance. We show that our mechanism reduces the price of anarchy of games with n jobs and unit activation costs from Θ(√(n)) to 2. We also show that for a restricted class of instances a similar improvement is achieved for monomial activation costs. This is not the case, however, for unrestricted instances of monomial costs for which we prove that the price of anarchy remains super-constant for our mechanism.


page 1

page 2

page 3

page 4


Selfish Jobs with Favorite Machines: Price of Anarchy vs Strong Price of Anarchy

We consider the well-studied game-theoretic version of machine schedulin...

Capacitated Network Design Games on a Generalized Fair Allocation Model

The cost-sharing connection game is a variant of routing games on a netw...

Resource-Aware Cost-Sharing Mechanisms with Priors

In a decentralized system with m machines, we study the selfish scheduli...

Scheduling to Optimize Sojourn Time of Successful Jobs

Deep neural networks training jobs and other iterative computations freq...

Learning to Schedule

This paper proposes a learning and scheduling algorithm to minimize the ...

Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games

In this paper, we analyze a transportation game first introduced by Fota...

Demand Response in the Smart Grid: the Impact of Consumers Temporal Preferences

In Demand Response programs, price incentives might not be sufficient to...