The price of anarchy of finite congestion games

We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ(√N), where N is the number of players. For all other cases of symmetric or asymmetric games and for both maximum and average social cost, the price of anarchy is 5/2. We extend the… CONTINUE READING

3 Figures & Tables

Topics

Statistics

02040'04'06'08'10'12'14'16'18
Citations per Year

401 Citations

Semantic Scholar estimates that this publication has 401 citations based on the available data.

See our FAQ for additional information.