Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
- 15 February 2013
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 69 (3) , 619-640
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On truthfulness and approximation for scheduling selfish tasksJournal of Scheduling, 2009
- Coordination mechanismsTheoretical Computer Science, 2009
- Worst-case equilibriaComputer Science Review, 2009
- A geometric approach to the price of anarchy in nonatomic congestion gamesGames and Economic Behavior, 2008
- Chapter 10 Traffic Equilibrium2007
- Truthful algorithms for scheduling selfish tasks on parallel machinesTheoretical Computer Science, 2006
- How much can taxes help selfish routing?Journal of Computer and System Sciences, 2006
- Linear tolls suffice: New bounds and algorithms for tolls in single source networksTheoretical Computer Science, 2005
- How bad is selfish routing?Journal of the ACM, 2002
- An Extended Traffic Assignment Model with Applications to Two-Way TrafficTransportation Science, 1971