Is the Price of Anarchy the Right Measure for Load-Balancing Games?

Abstract : Price of Anarchy is an oft-used worst-case measure of the inefficiency of non-cooperative decentralized architectures. For a non-cooperative load-balancing game with two classes of servers and for a finite or infinite number of dispatchers, we show that the Price of Anarchy is an overly pessimistic measure that does not reflect the performance obtained in most instances of the problem. We explicitly characterize the worst-case traffic conditions for the efficiency of non-cooperative load-balancing schemes, and show that, contrary to a common belief, the worst inefficiency is in general not achieved in heavy-traffic.
Type de document :
Article dans une revue
ACM Transactions on Internet Technology, Association for Computing Machinery, 2014, 14 (2-3), pp.1 - 20. 〈10.1145/2663498〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.laas.fr/hal-01462308
Contributeur : Olivier Brun <>
Soumis le : mercredi 8 février 2017 - 18:35:45
Dernière modification le : mardi 11 septembre 2018 - 15:19:08
Document(s) archivé(s) le : mardi 9 mai 2017 - 13:59:23

Fichier

TOIT2014.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Josu Doncel, Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu. Is the Price of Anarchy the Right Measure for Load-Balancing Games?. ACM Transactions on Internet Technology, Association for Computing Machinery, 2014, 14 (2-3), pp.1 - 20. 〈10.1145/2663498〉. 〈hal-01462308〉

Partager

Métriques

Consultations de la notice

74

Téléchargements de fichiers

58