Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Olivier Brun Connect in order to contact the contributor
Submitted on : Wednesday, February 8, 2017 - 6:35:45 PM
Last modification on : Tuesday, October 19, 2021 - 11:18:00 PM
Long-term archiving on: : Tuesday, May 9, 2017 - 1:59:23 PM


Files produced by the author(s)



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⟩



Record views


Files downloads