Atomic dynamic routing games with multiple destinations

DOI10.1007/S40305-023-00500-5MaRDI QIDQ6934518zbMATH OpenFDO

Authors Changjun Wang

Publication date 3 September 2025

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-023-00500-5

zbMATH Keywords

atomic dynamic routingFIFOmultiple destinationsNash equilibrium

Mathematics Subject Classification ID

Games involving graphs (91A43) Discrete-time games (91A50)

Cites work

• Atomic dynamic flow games: adaptive vs. nonadaptive agents
• Competitive routing over time
• Computation of Dynamic Equilibria in Series-Parallel Networks
• Dynamic Atomic Congestion Games with Seasonal Flows
• Dynamic equilibria in fluid queueing networks
• Long-term behavior of dynamic equilibria in fluid queuing networks
• Multi-source multi-sink Nash flows over time
• Nash equilibria and the price of anarchy for flows over time
• Nash flows over time with spillback
• Robust price of anarchy bounds via LP and Fenchel duality
• Routing games over time with FIFO policy

This page was built for publication: Atomic dynamic routing games with multiple destinations

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