Abstract
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for load balancing on related machines. We also give tight bounds for k-strong equilibria, where the size of a deviating coalition is at most k. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Fiat, A., Kaplan, H., Levy, M., & Olonetsky, S. (2007). Strong price of anarchy for machine load balancing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 583–594). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
