Strong Price of Anarchy for Machine Load Balancing

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. Key words: Game theory, Strong Nash equilibria, Load balancing, Price of Anarchy

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
• Keywords: ICALP 2007, Strong Equilibrium, Strong Nash Equilibria, Theoretical Computer Science, Tight Bounds