No open-access location is known for this record yet.
No open-access location is known for this record yet.
Abstract A noncooperative game is formulated on a transportation network with congestion. The players are associated with origin‐destination pairs, and are facing demand functions at their respective destination nodes. A Nash‐Cournot equilibrium is defined and conditions for existence and uniqueness of this solution are provided. The asymptotic behavior of the Nash‐Cournot equilibrium is then shown to yield (under appropriate assumptions) a total flow vector corresponding to a Wardrop equilibrium.
Loading…
Stored only when both papers are in the corpus — 328 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.