Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games.
Akaki MamageishviliPaolo PennaPublished in: Oper. Res. Lett. (2016)
Keyphrases
- load balancing
- nash equilibria
- upper bound
- game theoretic
- lower bound
- nash equilibrium
- game theory
- pure nash equilibria
- dynamic load balancing
- repeated games
- extensive form games
- distributed systems
- fault tolerance
- fault tolerant
- mobile agents
- peer to peer
- low overhead
- parallel query processing
- round robin
- load balance
- load distribution
- grid computing
- peer to peer systems
- skewed data
- parallel database systems
- load balancing strategy
- resource utilization
- cooperative
- resource allocation
- resource scheduling
- computing environments
- multi agent
- metadata