The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Selfish Routing and the Price of Anarchy
Abstract
Abstract Selfish routing is a classical mathematical model of how self-interested users might route traffic through a congested network. The outcome of selfish routing is generally inefficient, in that it fails to optimize natural objective functions. The price of anarchy is a quantitative measure of this inefficiency. We survey recent work that analyzes the price of anarchy of selfish routing. We also describe related results on bounding the worst-possible severity of a phenomenon called Braess's Paradox, and on three techniques for reducing the price of anarchy of selfish routing. This survey concentrates on the contributions of the author's PhD thesis, but also discusses several more recent results in the area.
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
The existence, uniqueness and stability of traffic equilibria
Smith, M. J. (1979) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(79)90022-5 · Cited by 857
Cited by
Efficient multi-user computation offloading for mobile-edge cloud computing
Chen, X., Jiao, L., Li, W., & Fu, X. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2487344 · Cited by 2,675
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Steps toward a science of service systems
Spohrer, J., Maglio, P. P., Bailey, J., & Gruhl, D. (2007) · Computer · doi:10.1109/mc.2007.33 · Cited by 1,264
Mechanical metamaterials with negative compressibility transitions
Nicolaou, Z. G., & Motter, A. E. (2012) · Nature Materials · doi:10.1038/nmat3331 · Cited by 522
Addressing the minimum fleet problem in on-demand urban mobility
Vazifeh, M. M., Santi, P., Resta, G., Strogatz, S. H., & Ratti, C. (2018) · Nature · doi:10.1038/s41586-018-0095-1 · Cited by 389
Metadata
- Venue
- Twenty Lectures on Algorithmic Game Theory
- Publisher
- Cambridge University Press
- Published
- 2016-08-31
- Pages
- 145-158
- OpenAlex
- W2097568888
- Cited by
- 647
- References
- 1
- FWCI
- 122.47
- Type
- book chapter
- Language
- en
- Open access
- closed
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: Selfish Routing and the Price of Anarchy. https://app.cochat.ai/papers/10.1017/cbo9781316779309.012
- The paper
- Selfish Routing and the Price of Anarchy. (2016). Twenty Lectures on Algorithmic Game Theory. https://doi.org/10.1017/cbo9781316779309.012
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.
