Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games.
Akaki MamageishviliPaolo PennaPublished in: CoRR (2015)
Keyphrases
- load balancing
- nash equilibria
- upper bound
- game theoretic
- lower bound
- nash equilibrium
- game theory
- pure nash equilibria
- dynamic load balancing
- peer to peer
- extensive form games
- distributed systems
- repeated games
- fault tolerant
- grid computing
- fault tolerance
- load balancing strategy
- low overhead
- load balance
- resource utilization
- peer to peer systems
- round robin
- parallel query processing
- data replication
- load distribution
- parallel database systems
- cooperative
- resource scheduling
- replication scheme
- long run
- computing resources
- digital libraries