Reference health
Equilibria in Dynamic Selfish Routing
16/16 checkable references clean · checked 2026-08-09
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
6 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 16 checked references that resolve
resolves10.1023/B:NETS.0000047114.31259.3d
Link Travel Times II: Properties Derived from Traffic-Flow Models
resolves10.1007/11561071_8
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,
resolves10.4086/cjtcs.2008.001
resolves10.1287/opre.37.6.893
Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
resolves10.1007/s00453-006-0196-3
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
resolves10.1023/A:1012827724856
Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future
The 6 references without a DOI — listed, not checked
no DOI — not checkedAnshelevich, E., Ukkusuri, S.: Equilibria in Dynamic Selfish Routing, http://www.cs.rpi.edu/~eanshel
no DOI — not checkedKöhler, E., Möhring, R.H., Skutella, M.: Traffic Networks and Flows Over Time. In: Kramer, J. (ed.) DFG Research Center: Mathematics for Key Technologies. Berliner Mathematische Gesellschaft, pp. 49–70 (2002)
no DOI — not checkedFleischer, L., Skutella, M.: Minumum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 66–75 (2003)
no DOI — not checkedRoughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)
no DOI — not checkedStier-Moses, N.: Selfish versus Coordinated Routing in Network Games. PhD Dissertation, Sloan School of Business, MIT (2004)
no DOI — not checkedWaller, S.T., Ukkusuri, S.: A linear program for the user optimal dynamic traffic assignment problem. In: Review, Transportation Science (2003)
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-08-09 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1007/978-3-642-04645-2_16"><img src="https://citestamp.com/citestamped/10.1007/978-3-642-04645-2_16/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1007/978-3-642-04645-2_16)