Asynchronous congestion games

Penn, M., Polukarov, M. and Tennenholtz, M. (2009) Asynchronous congestion games. Graph Theory, Computational Intelligence and Thought. Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, 41-53|xiv+227.


Full text not available from this repository.


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 show 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.

Item Type: Article
Additional Information: Imported from ISI Web of Science
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 270585
Date Deposited: 21 Apr 2010 07:46
Last Modified: 27 Mar 2014 20:15
Further Information:Google Scholar
ISI Citation Count:0

Actions (login required)

View Item View Item