Selfish Routing and the Price of Anarchy¶
Roughgarden, T. (2005). Selfish Routing and the Price of Anarchy. MIT Press.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Evolutionarily Stable Strategy
- Computer science — stability of distributed protocols against Byzantine deviators, analysis of selfish-routing equilibria, and evolutionary dynamics in multi-agent learning.
This sourceAnalyzes selfish-routing equilibria in networks and the price of anarchy — game-theoretic equilibrium and stability analysis of distributed/selfish agents in computer science.
- Computer science — stability of distributed protocols against Byzantine deviators, analysis of selfish-routing equilibria, and evolutionary dynamics in multi-agent learning.
- Nash Equilibrium
- The stability against unilateral deviation defines it, and crucially it need not be efficient: the equilibrium travel time can exceed the system-optimal time a central planner would assign, and the gap is the price of anarchy.
This sourceDefines and bounds the price of anarchy — the ratio of equilibrium to optimal cost in routing games — quantifying the gap between the Nash user-equilibrium and the system optimum.
- The stability against unilateral deviation defines it, and crucially it need not be efficient: the equilibrium travel time can exceed the system-optimal time a central planner would assign, and the gap is the price of anarchy.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:bedf874cb554 · see in the full table