Back to Search
Start Over
A dynamic approach for load balancing
- Source :
- The Third International Workshop on Game Theory in Communication Networks-GAMECOMM 2009, The Third International Workshop on Game Theory in Communication Networks-GAMECOMM 2009, Samson Lasaulce and Yezekael Hayel, Oct 2009, Pise, Italy, VALUETOOLS
- Publication Year :
- 2009
- Publisher :
- HAL CCSD, 2009.
-
Abstract
- International audience; 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.
- Subjects :
- Lyapunov function
TheoryofComputation_MISCELLANEOUS
Mathematical optimization
Computer Science::Computer Science and Game Theory
[INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]
Distributed computing
TheoryofComputation_GENERAL
020206 networking & telecommunications
0102 computer and information sciences
02 engineering and technology
Load balancing (computing)
01 natural sciences
symbols.namesake
010201 computation theory & mathematics
Nash equilibrium
Complete information
Best response
[INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT]
0202 electrical engineering, electronic engineering, information engineering
symbols
Economics
Risk dominance
Epsilon-equilibrium
Price of stability
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- The Third International Workshop on Game Theory in Communication Networks-GAMECOMM 2009, The Third International Workshop on Game Theory in Communication Networks-GAMECOMM 2009, Samson Lasaulce and Yezekael Hayel, Oct 2009, Pise, Italy, VALUETOOLS
- Accession number :
- edsair.doi.dedup.....bde25e6ef41af172ff63ed2fe5e83c80