Scheduling games with rank-based utilities

Abstract

Job scheduling on parallel machines is a well-studied singleton congestion game. We consider a variant of this game, arising in environments with strong competition. In a scheduling game with rank-based utilities (SRBG) the players are partitioned into competition sets, and the goal of every player is to perform well relative to its competitors.We show that SRBGs are significantly different from classical job-scheduling games, and that competition may lead to poor outcomes. An SRBG need not have a pure Nash equilibrium, and best-response dynamics may not converge to a NE even if one exists. We identify several classes of games for which a NE exists and can be computed efficiently, present tight bounds on the equilibrium inefficiencies, and suggest ways to modify SRBGs in order to guarantee NE existence.Our analysis provides insights for several other congestion and cost-sharing games that have a natural ‘rank-based’ variant.