Random Order Congestion Games

We introduce a new class of games called random order congestion games (ROCGs). In an ROCG, each player has a task that can be carried out by any element of a set of resources, and each resource executes its assigned tasks in a random order. The aim of each player is to minimize his expected cost, which is the sum of the fixed costs over the set of his utilized resources and the expected cost of his task execution. The cost of a player's task execution is determined by the earliest time his task is completed, and thus it might be beneficial for him to assign his task to several resources. We prove the existence of pure strategy Nash equilibria in ROCGs. Moreover, we present a polynomial time algorithm for finding such an equilibrium in a given ROCG.

[1]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[2]  L. Shapley,et al.  Potential Games , 1994 .

[3]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[4]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[5]  Moshe Tennenholtz,et al.  Distributed Games , 1998, TARK.

[6]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[7]  Elias Koutsoupias,et al.  Selfish Task Allocation , 2003, Bull. EATCS.

[8]  Paolo Penna,et al.  Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines , 2004, STACS.

[9]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[10]  Elias Koutsoupias,et al.  The price of anarchy of finite congestion games , 2005, STOC '05.

[11]  Evripidis Bampis,et al.  Randomized truthful algorithms for scheduling selfish tasks on parallel machines , 2005, Theor. Comput. Sci..

[12]  Moshe Tennenholtz,et al.  Congestion games with failures , 2005, EC '05.

[13]  Daniel Grosu,et al.  A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems , 2005, The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05).

[14]  D. Monderer,et al.  Solution-Based Congestion Games Advances in Mathematical Economics 8 , 397-409 ( 2006 ) , 2006 .

[15]  Daniel Grosu,et al.  Selfish Multi-User Task Scheduling , 2006, 2006 Fifth International Symposium on Parallel and Distributed Computing.

[16]  D. Monderer,et al.  Solution-based congestion games , 2006 .

[17]  Moshe Tennenholtz,et al.  Congestion games with load-dependent failures: identical resources , 2007, EC '07.

[18]  Moshe Tennenholtz,et al.  Asynchronous Congestion Games , 2009, Graph Theory, Computational Intelligence and Thought.