Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
Load balancing in processor sharing systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
The price of anarchy in parallel queues revisited
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Price of anarchy in non-cooperative load balancing
INFOCOM'10 Proceedings of the 29th conference on Information communications
The concert queueing game: to wait or to be late
Discrete Event Dynamic Systems
M/M/1-PS queue and size-aware task assignment
Performance Evaluation
Competition yields efficiency in load balancing games
Performance Evaluation
The price of forgetting in parallel and non-observable queues
Performance Evaluation
Price of anarchy in non-cooperative load balancing games
Performance Evaluation
Dispatching to incentivize fast service in multi-server queues
ACM SIGMETRICS Performance Evaluation Review
Minimizing slowdown in heterogeneous size-aware dispatching systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
We consider two criteria for routing selection in a multi-server service station: the equilibrium and social optimization. The ratio between the average mean waiting times in these two routings is called the price of anarchy (PoA). We show that the worst-case PoA is precisely the number of servers.