Optimizing throughput and makespan of queuing systems by information design

DOI10.4230/LIPICS.ESA.2024.62MaRDI QIDQ7253123zbMATH OpenFDO

Authors Max Klimm, Philipp Warode

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.62

zbMATH Keywords

convex envelopedynamic flowsinformation designpublic signals

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Stackelberg strategy for routing flow over time
• Continuity, uniqueness and long-term behavior of Nash flows over time
• Dynamic equilibria in fluid queueing networks
• Dynamic flows with adaptive route choice
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Informational Braess' paradox: the effect of information on traffic congestion
• Long-term behavior of dynamic equilibria in fluid queuing networks
• Mixture selection, mechanism design, and signaling
• 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
• On the hardness of signaling
• On the price of anarchy for flows over time
• On the Tractability of Public Persuasion with No Externalities
• Partition of Space
• Reverse search for enumeration
• The impact of spillback on the price of anarchy for flows over time
• Value of information in Bayesian routing games

This page was built for publication: Optimizing throughput and makespan of queuing systems by information design

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