Seminario Interdipartimentale di Algoritmica
 

Monday, November 26, 2007, 12:00 noon
Strong Price of anarchy for Machine Load Balancing
Svetlana Olonetsky, School of Computer Science, Tel Aviv University

DIS - Department of Computer Engineering, Via Ariosto 25
Room B2, ground floor

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 and unrelated  machines.

Joint work with Amos Fiat, Haim Kaplan, and Meital Levy