| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143083 | Operations Research Letters | 2007 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Moshe Haviv, Tim Roughgarden,