Bounding Residence Times for Atomic Dynamic Routings

DOI10.1287/MOOR.2021.1242MaRDI QIDQ5870375zbMATH OpenOpenAlexFDO

Authors Zhigang Cao, Bo Chen, Changjun Wang, Xujin 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

zbMATH Keywords

atomic dynamic routingNash equilibriumresidence timeselfish routingtoken technique

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Noncooperative games (91A10)

Recommendations

• Atomic dynamic flow games: adaptive vs. nonadaptive agents
• Equilibria in dynamic selfish routing
• Algorithms – ESA 2004
• Routing games over time with FIFO policy
• Equilibrium routing under uncertainty

Cites work

• A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
• Atomic dynamic flow games: adaptive vs. nonadaptive agents
• Competitive routing over time
• Direct routing: Algorithms and complexity
• Dynamic Atomic Congestion Games with Seasonal Flows
• Dynamic equilibria in fluid queueing networks
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Greedy Packet Scheduling
• Greedy Packet Scheduling on Shortest Paths
• scientific article; zbMATH DE number 1256754 (Why is no real title available?)
• scientific article; zbMATH DE number 1559580 (Why is no real title available?)
• Long term behavior of dynamic equilibria in fluid queuing networks
• Methods for message routing in parallel machines
• Multicommodity flows over time: Efficient algorithms and complexity
• Nash equilibria and the price of anarchy for flows over time
• Nash equilibria and the price of anarchy for flows over time
• Nash flows over time with spillback
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Packet Routing: Complexity and Algorithms
• Quickest Flows Over Time
• Real-Time Message Routing and Scheduling
• The price of anarchy for instantaneous dynamic equilibria
• The quickest transshipment problem
• Universal Bufferless Packet Switching

Cited in

(1)

• On the price of anarchy in packet routing games with FIFO

This page was built for publication: Bounding Residence Times for Atomic Dynamic Routings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870375)