Skip to Main content Skip to Navigation
Conference papers

A dynamic approach for load balancing

Abstract : We study how to reach a Nash equilibrium in a load balanc- ing scenario where each task is managed by a selfish agent and attempts to migrate to a machine which will minimize its cost. The cost of a machine is a function of the load on it. The load on a machine is the sum of the weights of the jobs running on it. We prove that Nash equilibria can be learned on that games with incomplete information, using some Lyapunov techniques.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Octave Boussaton Connect in order to contact the contributor
Submitted on : Monday, November 23, 2009 - 4:39:42 PM
Last modification on : Friday, May 13, 2022 - 10:18:05 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 2:41:36 PM


Files produced by the author(s)


  • HAL Id : inria-00435160, version 1



Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen. A dynamic approach for load balancing. The Third International Workshop on Game Theory in Communication Networks - GAMECOMM 2009, Samson Lasaulce and Yezekael Hayel, Oct 2009, Pise, Italy. ⟨inria-00435160⟩



Record views


Files downloads