A Game-Theoretic Framework for Distributed Load Balancing: Static and Dynamic Game Models

TL;DR

This paper introduces a game-theoretic framework for distributed load balancing in static and dynamic settings, demonstrating convergence to equilibrium and analyzing efficiency through the price of anarchy.

Contribution

It formulates static and dynamic load balancing as potential games, proving convergence of best-response dynamics and providing bounds on system efficiency.

Findings

Static game has a pure Nash equilibrium with convergence in n iterations.

Dynamic game strategies converge to static equilibrium, balancing load efficiently.

Convergence time scales polynomially with game parameters.

Abstract

Motivated by applications in job scheduling, queuing networks, and load balancing in cyber-physical systems, we develop and analyze a game-theoretic framework to balance the load among servers in static and dynamic settings. In these applications, jobs/tasks are held by selfish entities that do not want to coordinate with each other, yet the goal is to balance the load among servers in a distributed manner. First, we provide a static game formulation in which each player holds a job with a specific processing requirement and wants to schedule it fractionally among a set of heterogeneous servers to minimize its average processing time. We show that this static game is a potential game with a pure Nash equilibrium (NE). In particular, the best-response dynamics converge to such an NE after $n$ iterations, where $n$ is the number of players. Additionally, we bound the price of anarchy (PoA) of the static game in terms of game parameters. We then extend our results to a dynamic game setting, where jobs arrive and get processed, and players observe the load on the servers to decide how to schedule their jobs. In this setting, we show that if the players update their strategies using dynamic best-response, the system eventually becomes fully load-balanced and the players' strategies converge to the pure NE of the static game. In particular, we show that the convergence time scales only polynomially with respect to the game parameters. Finally, we provide numerical results to evaluate the performance of our proposed algorithms.