Acta Mathematicae Applicatae Sinica, English Series

, Volume 25, Issue 4, pp 723–736

Equilibria in load balancing games

Article

DOI: 10.1007/s10255-009-8832-8

Cite this article as:
Chen, B. Acta Math. Appl. Sin. Engl. Ser. (2009) 25: 723. doi:10.1007/s10255-009-8832-8

Abstract

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.

Keywords

Nash equilibriumload balancingapproximation

2000 MR Subject Classification

91B5068M20

Copyright information

© Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Qufu Normal UniversityShandongChina
  2. 2.Warwick Business SchoolUniversity of WarwickWarwickUK