Random Order Congestion Games
Penn, Michal, Polukarov, Maria and Tennenholtz, Moshe (2009) Random Order Congestion Games. Mathematics of Operations Research, 34, (3), 706-725.
This is the latest version of this item.
We introduce a new class of games, 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. 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 ROCGs. Moreover, we present a polynomial time algorithm for finding such an equilibrium in a given ROCG.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||23 Sep 2009 14:52|
|Last Modified:||23 Aug 2012 03:56|
|Contributors:||Penn, Michal (Author)
Polukarov, Maria (Author)
Tennenholtz, Moshe (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||2|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Available Versions of this Item
Random Order Congestion Games. (deposited 16 Sep 2009 20:21)
- Random Order Congestion Games. (deposited 23 Sep 2009 14:52) [Currently Displayed]
Actions (login required)