On the price of anarchy for flows over time

DOI10.1287/MOOR.2021.1173MaRDI QIDQ5085146zbMATH OpenOpenAlexFDO

Authors 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

dynamic equilibriumflows over timeprice of anarchy

Mathematics Subject Classification ID

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

Recommendations

• Nash equilibria and the price of anarchy for flows over time
• Nash equilibria and the price of anarchy for flows over time
• Equilibria in dynamic selfish routing
• The impact of spillback on the price of anarchy for flows over time
• When is selfish routing bad? The price of anarchy in light and heavy traffic

Cites work

• A Stackelberg strategy for routing flow over time
• An introduction to network flows over time
• Competitive routing over time
• Constructing maximal dynamic flows from static flows
• Dynamic Atomic Congestion Games with Seasonal Flows
• Dynamic equilibria in fluid queueing networks
• Dynamic flows with adaptive route choice
• Efficient continuous-time dynamic network flow algorithms
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1024734 (Why is no real title available?)
• scientific article; zbMATH DE number 934458 (Why is no real title available?)
• Long term behavior of dynamic equilibria in fluid queuing networks
• Nash equilibria and the price of anarchy for flows over time
• Nash flows over time with spillback
• Network flows. Theory, algorithms, and applications.
• Routing games over time with FIFO policy
• Transient flows in networks
• Worst-case equilibria

Cited in

(13)

• FIFO and randomized competitive packet routing games
• The impact of spillback on the price of anarchy for flows over time
• The price of anarchy for instantaneous dynamic equilibria
• Equilibria in dynamic selfish routing
• Nash equilibria and the price of anarchy for flows over time
• Algorithms for Flows over Time with Scheduling Costs
• Price of Anarchy in Networks with Heterogeneous Latency Functions
• AN INDIVIDUAL AND SOCIALLY OPTIMAL POLICY MINIMIZING EXPECTED FLOW TIMES
• The Price of Anarchy for Instantaneous Dynamic Equilibria
• Nash equilibria and the price of anarchy for flows over time
• Bicriteria Nash flows over time
• On the price of anarchy in packet routing games with FIFO
• Optimizing throughput and makespan of queuing systems by information design

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: On the price of anarchy for flows over time

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