The price of anarchy in an exponential multi-server

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.