Instantaneous Dynamic Equilibria: Existence, Computation and Quality

Lukas Graf ()
Additional contact information
Lukas Graf: University of Passau

A chapter in Operations Research Proceedings 2024, 2025, pp 3-9 from Springer

Abstract: Abstract Instantaneous dynamic equilibria (IDE) are an equilibrium concept for flows over time with deterministic queueing wherein individual flow particles make selfish decisions based on current information. This can be used as a model for car traffic where each driver initially chooses her route in such a way as to minimize her travel time under the current congestion state of the road network and then continuously adapts her route while driving. In this paper we summarize the main results from the author’s dissertation [4] on this topic, which addresses the following three fundamental questions: Under which conditions are IDE guaranteed to exist? Can we compute IDE and, if so, what is the computational complexity of such a computation? How do IDE compare to system optimal flows when considering different quality measure such as total travel time or makespan?

Keywords: Dynamic Network Flows; Adaptive Route Choice; Equilibrium Existence; Price of Anarchy (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-92575-7_1

Ordering information: This item can be ordered from
http://www.springer.com/9783031925757

DOI: 10.1007/978-3-031-92575-7_1

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().