Asynchronous Congestion Games

We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, 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. Each player's aim is to minimize his expected cost which is the sum of two terms - 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 ACGs. Moreover, we present a polynomial time algorithm for finding such an equilibrium in a given ACG.

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

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

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

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

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

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

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

[8]  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).

[9]  Ron Holzman,et al.  On the Least Core and the Mas-Colell Bargaining Set , 1999 .

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

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

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

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

[14]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[15]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

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

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

[18]  Igor Walukiewicz,et al.  Distributed Games , 2003, FSTTCS.