The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems
ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
Selfish Multi-User Task Scheduling
ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
Congestion games with load-dependent failures: identical resources
Proceedings of the 8th ACM conference on Electronic commerce
Truthful algorithms for scheduling selfish tasks on parallel machines
WINE'05 Proceedings of the First international conference on Internet and Network Economics
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Mathematics of Operations Research
Graph Theory, Computational Intelligence and Thought
Games with Congestion-Averse Utilities
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
| Hi-index | 0.00 |
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.