Equilibria in load balancing games

A Nash equilibrium (NE) in a multi-agent game is a strategy profile that is resilient to unilateral deviations. A strong Nash equilibrium (SE) is one that is stable against coordinated deviations of any coalition. We show that, in the load balancing games, NEs approximate SEs in the sense that the benefit of each member of any coalition from coordinated deviations is well limited. Furthermore, we show that an easily recognizable special subset of NEs exhibit even better approximation of SEs.