Selfish Routing on Transportation Networks With Supply and Demand Constraints

preprint OA: closed CC-BY-4.0

Abstract

Traditional non-atomic selfish routing games present some limitations in properly modeling road traffic. This paper introduces a novel type of non-atomic selfish routing game leveraging concepts from Daganzo’s cell transmission model (CTM). Each network link is characterized by a supply and demand mechanism that enforces capacity constraints based on current density, providing a more accurate representation of real-world traffic phenomena. We characterize the Wardrop equilibria and social optima of this game and identify a previously unrecognized inefficiency in selfish routing: partially transferring Wardrop equilibria, where only part of the exogenous flow traverses the network.
Full text 621 characters · extracted from oa-doi-fallback · click to expand
There is a newer version available for this {{ publicationType }}. View latest version {{ publication.field_name }} {{ publication.subfield_name }} Copyright: © {{ publicationYear }} {{ publication.presentation_authors[0].full_name + (publication.presentation_authors.length > 1 ? ' et al' : '') }}. This is an open access publication distributed under the terms of the CC BY 4.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Check the {{ publicationType | capitalize }} Source for copyright and license information. Listen on

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: oa-doi-fallback

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0