The Stability of a Dynamic Model of Traffic Assignment—An Application of a Method of Lyapunov

Unknown author

487 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Game Theory and Applications

Abstract

This paper considers a dynamic model of traffic assignment in which drivers change their route choices to take advantage of cheaper routes. Using a method due to Lyapunov, we show that if the cost-flow function is monotone and there are no explicit capacity restrictions then any solution trajectory of our dynamical system converges to the set of Wardrop equilibria as time passes.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 487 citations exist upstream.

References

1989Non-cooperative games

Cited by

1994Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems 1995Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory 1989A stochastic process approach to the analysis of temporal dynamics in transportation networks 2009Stable games and their dynamics 1985Transportation network equilibrium, design and aggregation: Key developments and research opportunities 2019Multiclass traffic assignment model for mixed traffic flow of human-driven vehicles and connected and autonomous vehicles 2009A link-based day-to-day traffic assignment model 1999Stability of the stochastic equilibrium assignment problem: a dynamical systems approach

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.