Price of Anarchy in Non-Cooperative Load Balancing - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Price of Anarchy in Non-Cooperative Load Balancing

(1) , (1) , (1)


We investigate the price of anarchy of a load balancing game with $K$ dispatchers. The service rates and holding costs are assumed to depend on the server, and the service discipline is assumed to be processor-sharing at each server. The performance criterion is taken to be the weighted mean number of jobs in the system, or equivalently, the weighted mean sojourn time in the system. We first show that, for a fixed amount of total incoming traffic, the worst-case Nash equilibrium occurs when each player routes exactly the same amount of traffic, i.e., when the game is symmetric. For this symmetric game, we provide the expression for the loads on the servers at the Nash equilibrium. Using this result we then show that, for a system with two or more servers, the price of anarchy, which is the worst-case ratio of the global cost of the Nash equilibrium to the global cost of the centralized setting, is lower bounded by $K/(2\sqrt{K}-1)$ and upper bounded by$\sqrt{K}$, independently of the number of servers.
Fichier principal
Vignette du fichier
poa_noncooperative_loadbalancing.pdf (327.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00416123 , version 1 (11-09-2009)


  • HAL Id : hal-00416123 , version 1


Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu. Price of Anarchy in Non-Cooperative Load Balancing. 2009. ⟨hal-00416123⟩
154 View
161 Download


Gmail Facebook Twitter LinkedIn More