Dynamic equilibria in fluid queueing networks
From MaRDI portal
Abstract: This paper continues the study of equilibria for flows over time in the fluid queueing model recently considered by Koch and Skutella [10]. We provide a constructive proof for the existence and uniqueness of equilibria in the case of a single origin-destination with piecewise constant inflow rates, through a detailed analysis of the static flows obtained as derivatives of a dynamic equilibrium. We also give a nonconstructive existence proof of equilibria when the inflow rates belong to including the extension to multiple origin-destinations.
Recommendations
Cites work
- A first course in Sobolev spaces
- A Stackelberg strategy for routing flow over time
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- Advances in the Continuous Dynamic Network Loading Problem
- An introduction to network flows over time
- Efficient continuous-time dynamic network flow algorithms
- Existence and Uniqueness of Equilibria for Flows over Time
- scientific article; zbMATH DE number 1024734 (Why is no real title available?)
- scientific article; zbMATH DE number 934458 (Why is no real title available?)
- scientific article; zbMATH DE number 5196546 (Why is no real title available?)
- Nash equilibria and the price of anarchy for flows over time
- On the existence of solutions to the dynamic user equilibrium problem
- Transient flows in networks
- Équations et inéquations non linéaires dans les espaces vectoriels en dualité
Cited in
(28)- Convergence to equilibria for fluid models of FIFO queueing networks
- FIFO and randomized competitive packet routing games
- Algorithms for flows over time with scheduling costs
- Equilibrium strategies in an unobservable on-off fluid queue
- Long term behavior of dynamic equilibria in fluid queuing networks
- Equlibria for data networks
- Fluid dynamics models and their applications in transportation and pricing
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- Algorithms for Time-Varying Networks of Many-Server Fluid Queues
- Solving Multi-Regime Feedback Fluid Queues
- Dynamic Atomic Congestion Games with Seasonal Flows
- Long-term behavior of dynamic equilibria in fluid queuing networks
- Atomic dynamic flow games: adaptive vs. nonadaptive agents
- Algorithms for Flows over Time with Scheduling Costs
- Computation of Dynamic Equilibria in Series-Parallel Networks
- On the price of anarchy for flows over time
- Nash flows over time with spillback
- Bounding Residence Times for Atomic Dynamic Routings
- A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
- Dynamic flows with adaptive route choice
- Dynamic flows with adaptive route choice
- A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
- Equilibria in bottleneck games
- Convergence of a Packet Routing Model to Flows over Time
- Bicriteria Nash flows over time
- Atomic dynamic routing games with multiple destinations
- Optimizing throughput and makespan of queuing systems by information design
- Optima and equilibria for traffic flow on networks with backward propagating queues
This page was built for publication: Dynamic equilibria in fluid queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195227)
