2022/01/26 by Fiat, Amos, Levy, Meital, Kaplan, Haim +1
#Game theory #Load balancing #Price of Anarchy #Strong Nash equilibria
paper · doi:10.4230/dagsemproc.07261.12
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, for unrelated machines.