On the Equilibria of Resource-Sharing Games - Archive ouverte HAL Access content directly
Reports Year :

On the Equilibria of Resource-Sharing Games

(1) , (1) , (1) , (1)


We investigate the strategic interaction between a fixed number of users sharing the capacity of a processor operating with relative priorities. Each user chooses a payment, which corresponds to his priority level, and submits jobs of variable sizes according to a stochastic process. These jobs have to be completed before some user-specific deadline. They are executed on the processor and receive a share of the capacity that is proportional to the priority level. The users' goal is to choose priority levels so as to minimize their own payment, while guaranteeing that their jobs meet their deadlines. Given the complexity of the underlying queueing model, we develop an approximation based on heavy-traffic. We characterize the solution of the game under the heavy-traffic assumption and we numerically investigate the accuracy of the approximation. Our results show that the approximate solution captures accurately the structure of the equilibrium in the original game.
Fichier principal
Vignette du fichier
RS_games.pdf (242.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00910195 , version 1 (29-11-2013)


  • HAL Id : hal-00910195 , version 1


Josu Doncel, Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu. On the Equilibria of Resource-Sharing Games. 2013. ⟨hal-00910195⟩
151 View
58 Download


Gmail Facebook Twitter LinkedIn More