The University of Southampton
University of Southampton Institutional Repository

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.

Record type: Article


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.

Full text not available from this repository.

More information

Published date: 2009
Additional Information: Imported from ISI Web of Science
Organisations: Agents, Interactions & Complexity


Local EPrints ID: 270585
PURE UUID: 4a5533ea-b3a1-4903-ae87-5f049b36c573

Catalogue record

Date deposited: 21 Apr 2010 07:46
Last modified: 18 Jul 2017 06:51

Export record


Author: M. Penn
Author: M. Polukarov
Author: M. Tennenholtz

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.