| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334500 | Theoretical Computer Science | 2009 | 10 Pages |
Abstract
We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and non-colluding agents. The quality of a coordination mechanism is measured by its price of anarchy-the worst-case performance of a Nash equilibrium over the (centrally controlled) social optimum. We give upper and lower bounds for the price of anarchy for selfish task allocation and congestion games.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
George Christodoulou, Elias Koutsoupias, Akash Nanavati,