A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coordination Mechanisms
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding 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.
doi:10.1007/978-3-540-27836-8_31
fatcat:h4ovmqoo5nf5bj5fielifq72ai