Bounding Residence Times for Atomic Dynamic Routings
From MaRDI portal
Publication:5870375
DOI10.1287/moor.2021.1242zbMath1506.90070OpenAlexW4213091691MaRDI QIDQ5870375
Changjun Wang, Bo Chen, Zhigang Cao, Xu-jin Chen
Publication date: 9 January 2023
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2021.1242
Cites Work
- Unnamed Item
- Unnamed Item
- Braess's paradox for flows over time
- Nash equilibria and the price of anarchy for flows over time
- Competitive routing over time
- Methods for message routing in parallel machines
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Direct routing: Algorithms and complexity
- Multicommodity flows over time: Efficient algorithms and complexity
- Long term behavior of dynamic equilibria in fluid queuing networks
- The price of anarchy for instantaneous dynamic equilibria
- A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
- The Quickest Transshipment Problem
- Dynamic Equilibria in Fluid Queueing Networks
- Universal Bufferless Packet Switching
- Packet Routing: Complexity and Algorithms
- Real-Time Message Routing and Scheduling
- Nash Equilibria and the Price of Anarchy for Flows over Time
- Greedy Packet Scheduling
- Greedy Packet Scheduling on Shortest Paths
- Dynamic Atomic Congestion Games with Seasonal Flows
- Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents
- Nash Flows Over Time with Spillback
- Quickest Flows Over Time
This page was built for publication: Bounding Residence Times for Atomic Dynamic Routings
