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.
Document type :
Journal articles
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

Cited literature [17 references]  Display  Hide  Download

https://hal.laas.fr/hal-01462308
Contributor : Olivier Brun <>
Submitted on : Wednesday, February 8, 2017 - 6:35:45 PM
Last modification on : Thursday, January 11, 2018 - 6:26:28 AM
Document(s) archivé(s) le : Tuesday, May 9, 2017 - 1:59:23 PM

File

TOIT2014.pdf
Files produced by the author(s)

Identifiers

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〉

Share

Metrics

Record views

33

Files downloads

37