在负载平衡博弈中的近似强均衡问题.pdfVIP

Approximate Strong Equilibrium in Load Balancing Games LI Song-song1 ZHANG Yu-zhong1,2 ZHANG Kai-ju1,2 1.School of Management, Qufu Normal University;2Rizhao Radio and Television University, 276826,Rizhao Shandong, PRC Abstract:This paper studies approximate strong equilibrium in the load balancing games with i dentical servers. A Nash equilibrium (NE) is a strategy profile that is resilient to unilateral devia tions. A strong Nash equilibrium (SE) is one that is stable against coordinated deviations of any co alition. Given any job assignment in a load balancing game, the improvement ratio (IR) of a devia tion of a job is defined as the ratio between the prt- and post-deviation costs. An NE is said to be a ρ-approximate SE (ρ≥1) ff there is no coalition of jobs such that each job of the coalition will has an IR more than ρ from coordinated deviations of the coalition. This paper shows, for load balancing games of up to 8 servers, any NE assignment is a 5/4-approximate SE, and the bound is tight. Fur thermore, it is a(3/2-2m-3/2(m-1)2) - approximate SE if the game has m(m≥9) servers. Nash equilibrium ; load balancing; approximation O224 A 1001-5337(2012)03-0030-12 2012-04-16 The NIVSF of China ,the NSF of shandong Province(ZR2010AM034). LI Song-song,rmale,1982-,Maste degree Candidate;Majorim: Sorting theory. E-mail: 1631isongsong@ 163. com; Zhang Yu-zhong,male,1964-,PHD, Profeseor,doctoral supervisor; Major in:Sorting theory. E-mail:yuzhongrz@ 163. com. cessing time al nected. Therefor ty: r( L + + L d according to the NE In this ase, it to Eight Servers d (20) give us th ollo a 6-server load ased coalitio r =R(A). tctures like Figu @@[ 1 ] Bo Chen. Equilibria in Load Balancing