The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Price of Anarchy in Transportation Networks: Efficiency and Optimality Control
Open accessAbstract
Uncoordinated individuals in human society pursuing their personally optimal strategies do not always achieve the social optimum, the most beneficial state to the society as a whole. Instead, strategies form Nash equilibria which are often socially suboptimal. Society, therefore, has to pay a price of anarchy for the lack of coordination among its members. Here we assess this price of anarchy by analyzing the travel times in road networks of several major cities. Our simulation shows that uncoordinated drivers possibly waste a considerable amount of their travel time. Counterintuitively, simply blocking certain streets can partially improve the traffic conditions. We analyze various complex networks and discuss the possibility of similar paradoxes in physics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Empirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
Über ein Paradoxon aus der Verkehrsplanung
Braess, D. (1968) · Unternehmensforschung Operations Research - Recherche Opérationnelle · doi:10.1007/bf01918335 · Cited by 911
Selfish Routing and the Price of Anarchy
Roughgarden, T. (2006) · doi:10.21236/ada637949 · Cited by 672
Selfish Routing and the Price of Anarchy
(2016) · Twenty Lectures on Algorithmic Game Theory · doi:10.1017/cbo9781316779309.012 · Cited by 647
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
Jahn, O., Möhring, R. H., Schulz, A. S., & Stier‐Moses, N. E. (2005) · Operations Research · doi:10.1287/opre.1040.0197 · Cited by 267
Commuters route choice behaviour
Selten, R., Chmura, T., Pitz, T., Kube, S., & Schreckenberg, M. (2007) · Games and Economic Behavior · doi:10.1016/j.geb.2006.03.012 · Cited by 218
Cited by
Morphology of travel routes and the organization of cities
Lee, M., Barbosa, H., Youn, H., Holme, P., & Ghoshal, G. (2017) · Nature Communications · doi:10.1038/s41467-017-02374-7 · Cited by 88
Self-citation
Metadata
- Authors
- Youn, H., Gastner, M. T., & Jeong, H.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2008-09-17
- Volume
- 101
- Issue
- 12
- Pages
- 128701-128701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2122858720
- Cited by
- 286
- References
- 13
- FWCI
- 34.90
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Price of Anarchy in Transportation Networks: Efficiency and Optimality Control. https://app.cochat.ai/papers/10.1103/physrevlett.101.128701
- The paper
- Youn, H., Gastner, M. T., & Jeong, H. (2008). Price of Anarchy in Transportation Networks: Efficiency and Optimality Control. Physical Review Letters. https://doi.org/10.1103/physrevlett.101.128701
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
