Price of Anarchy in Transportation Networks¶
Youn, H., Gastner, M. T., & Jeong, H. (2008). Price of Anarchy in Transportation Networks: Efficiency and Optimality Control. Physical Review Letters, 101(12).
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Braess's Paradox
- The interventions the prime carries are sharp and substrate-portable, each aimed at the same structural locus — the gap between selfish equilibrium and social optimum on a network with load-dependent costs. Audit before adding: before committing capacity to a congestion-prone, selfishly-routed network, model the best-response equilibrium with and without the addition rather than assuming monotone improvement. Consider removal: when a network performs badly, evaluate whether cutting edges — closing roads, dropping links, decommissioning lines — would shift the equilibrium for the better, the move that improved traffic in Seoul, Stuttgart, and New York.
This sourceIdentifies real road links (in Boston, New York, and London) whose closure can reduce predicted travel times — documented real-world Braess removals; complements the Seoul Cheonggyecheon expressway removal that improved flow.
- The interventions the prime carries are sharp and substrate-portable, each aimed at the same structural locus — the gap between selfish equilibrium and social optimum on a network with load-dependent costs. Audit before adding: before committing capacity to a congestion-prone, selfishly-routed network, model the best-response equilibrium with and without the addition rather than assuming monotone improvement. Consider removal: when a network performs badly, evaluate whether cutting edges — closing roads, dropping links, decommissioning lines — would shift the equilibrium for the better, the move that improved traffic in Seoul, Stuttgart, and New York.
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.
Registry ID ref:5d48c931ebf4 · see in the full table