Asynchronous Congestion Games
Penn, Michal, Polukarov, Maria and Tennenholtz, Moshe (2008) Asynchronous Congestion Games. In, AAMAS-08 , 1605-1608.
- Published Version
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||16 Sep 2009 19:07|
|Last Modified:||02 Mar 2012 11:59|
|Contributors:||Penn, Michal (Author)
Polukarov, Maria (Author)
Tennenholtz, Moshe (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)