The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler

Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu

Abstract: Highlights•We study a load balancing game with uncertainty imposed by a randomizing scheduler.•We provide nearly tight upper bounds on PoAs when players follow the win-or-go-home and minimum-expected-cost principles.•The bottom-out principle is studied for the first time in load balancing games.•Non-optimal prices of stabilities exhibit a sharp contrast with the classical load balancing games.