Randomized algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A new model for selfish routing
Theoretical Computer Science
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
The Price of Stochastic Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Worst-Case Nash Equilibria in Restricted Routing
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Non-clairvoyant Scheduling Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory (TOCT)
On the inefficiency of equilibria in linear bottleneck congestion games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the quality and complexity of pareto equilibria in the job scheduling game
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Smoothed performance guarantees for local search
ESA'11 Proceedings of the 19th European conference on Algorithms
Exact Price of Anarchy for Polynomial Congestion Games
SIAM Journal on Computing
Local search performance guarantees for restricted related parallel machine scheduling
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsoupias and Papadimitriou to measure the performance degradation due to the lack of a centralized traffic regulating authority. We provide a full characterization of the worst-case coordination ratio in the restricted assignment and unrelated parallel links model. In particular, we quantify the tradeoff between the "negligibility" of the traffic controlled by each user and the worst-case coordination ratio. We analyze both pure and mixed strategies systems and identify the range where their performance is similar.