On the Price of Anarchy for Flows over Time

DOI10.1287/moor.2021.1173zbMath1492.91058OpenAlexW4206557425MaRDI QIDQ5085146

José R. Correa, Andrés Cristi, Tim Oosterwijk

Publication date: 27 June 2022

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/be49110d-dc69-484c-9b8f-1087bbb02a42

zbMATH Keywords

price of anarchyflows over timedynamic equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Algorithmic game theory and complexity (91A68)

Related Items (2)

Algorithms for Flows over Time with Scheduling Costs ⋮ FIFO and randomized competitive packet routing games

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Transient flows in networks
• Efficient continuous-time dynamic network flow algorithms
• Long term behavior of dynamic equilibria in fluid queuing networks
• A Stackelberg strategy for routing flow over time
• An Introduction to Network Flows over Time
• 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
• Constructing Maximal Dynamic Flows from Static Flows
• Dynamic flows with adaptive route choice

This page was built for publication: On the Price of Anarchy for Flows over Time