A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
From MaRDI portal
Publication:5918424
DOI10.1007/978-3-030-73879-2_8zbMath1482.91055arXiv2007.07808OpenAlexW3163015791MaRDI QIDQ5918424
Publication date: 21 December 2021
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.07808
Games involving graphs (91A43) Combinatorial games (91A46) Algorithmic game theory and complexity (91A68)
Related Items (1)
Cites Work
- Unnamed Item
- Nash equilibria and the price of anarchy for flows over time
- Competitive routing over time
- Dynamic urban transportation network models: theory and implications for intelligent vehicle-highway systems
- Long term behavior of dynamic equilibria in fluid queuing networks
- The price of anarchy for instantaneous dynamic equilibria
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
- Dynamic Equilibria in Fluid Queueing Networks
- Routing Games over Time with FIFO Policy
- Dynamic Atomic Congestion Games with Seasonal Flows
- Nash Flows Over Time with Spillback
- A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models
- Solving an Instantaneous Dynamic User-Optimal Route Choice Model
- A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
- Dynamic flows with adaptive route choice
This page was built for publication: A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
