Mobility

Approximate Congestion Games for Load Balancing in Distributed Environment

Free registration required

Executive Summary

The use of game theoretic models has been quite successful in describing various cooperative and non-cooperative optimization problems in networks and other domains of computer systems. In this paper, the authors study an application of game theoretic models in the domain of distributed system, where nodes play a game to balance the total processing loads among themselves. They have used congestion gaming model, a model of game theory where many agents compete for allocating resources, and studied the existence of Nash Equilibrium for such types of games.

  • Format: PDF
  • Size: 672.26 KB