The DOI matches its Crossref record.
The price of selfish routing
Abstract
We study the problem of routing traffic through a congested network. We focus on the simplest case of a network consisting of m parallel links. We assume a collection of n network users, each employing a mixed strategy which is a probability distribution over links, to control the shipping of its own assigned traffic. Given a capacity for each link specifying the rate at which the link processes traffic, the objective is to route traffic so that the maximum expected latency over all links is minimized. We consider both uniform and non-uniform link capacities.
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
Cited by
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
Algorithms, games, and the internet
Papadimitriou, C. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380883 · Cited by 1,085
Roughgarden, T., & Tardos, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892069 · Cited by 277
Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends
Moura, J., & Hutchison, D. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2863030 · Cited by 193
Metadata
- Authors
- Mavronicolas, M., & Spirakis, P.
- Venue
- Proceedings of the thirty-third annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2001-07-06
- Pages
- 510-519
- OpenAlex
- W2030914480
- Cited by
- 183
- References
- 0
- FWCI
- 7.39
- Type
- conference paper
- 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: The price of selfish routing. https://app.cochat.ai/papers/10.1145/380752.380846
- The paper
- Mavronicolas, M., & Spirakis, P. (2001). The price of selfish routing. Proceedings of the thirty-third annual ACM symposium on Theory of computing. https://doi.org/10.1145/380752.380846
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.