The Price of Anarchy for Restricted Parallel Links

In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed links for the user. In a (pure) Nash equilibrium, no user may improve its own Individual Cost (latency) by unilaterally switching to another link from its set of allowed links. The Price of Anarchy is a widely adopted measure of the worst-case loss (relative to optimum) in system performance (maximum latency) incurred in a Nash equilibrium. In this work, we present a comprehensive collection of bounds on Price of Anarchy for the model of restricted parallel links. Specifically, we prove:

• Type: Journal
• Year: 2006
• Where: PPL
• Authors: Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
• Keywords: Anarchy, Nash Equilibrium, Parallel Links, PPL 2006