Scheduling Games with Machine-Dependent Priority Lists

by   Marc Schroder, et al.

We consider a scheduling game in which jobs try to minimize their completion time by choosing a machine to be processed on. Each machine uses an individual priority list to decide on the order according to which the jobs on the machine are processed. We characterize four classes of instances in which a pure Nash equilibrium (NE) is guaranteed to exist, and show, by means of an example, that none of these characterizations can be relaxed. We then bound the performance of Nash equilibria for each of these classes with respect to the makespan of the schedule and the sum of completion times. We also analyze the computational complexity of several problems arising in this model. For instance, we prove that it is NP-hard to decide whether a NE exists, and that even for instances with identical machines, for which a NE is guaranteed to exist, it is NP-hard to approximate the best NE within a factor of 2-1/m-ϵ for all ϵ>0. In addition, we study a generalized model in which players' strategies are subsets of resources, each having its own priority list over the players. We show that in this general model, even unweighted symmetric games may not have a pure NE, and we bound the price of anarchy with respect to the total players' costs.


page 1

page 2

page 3

page 4


Complexity Results about Nash Equilibria

Noncooperative game theory provides a normative framework for analyzing ...

Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy

We study a general scenario of simultaneous contests that allocate prize...

The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games

We revisit the complexity of deciding, given a bimatrix game, whether i...

When Nash Meets Stackelberg

We analyze Nash games played among leaders of Stackelberg games (), and ...

Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version)

We study the problem of finding Stackelberg equilibria in games with a m...

The Impact of Selfish Behavior in Load Balancing Games

To what extent does the structure of the players' strategy space influen...

Hardness Results for Weaver's Discrepancy Problem

Marcus, Spielman and Srivastava (Annals of Mathematics 2014) solved the ...

Please sign up or login with your details

Forgot password? Click here to reset