© 2019 Association for Computing Machinery.Dynamic network flows, or network flows over time, constitute an important model for real-world situations where steady states are unusual, such as urban traffic and the Internet. These applications immediately raise the issue of analyzing dynamic network flows from a game-theoretic perspective. In this paper we study dynamic equilibria in the deterministic fluid queuing model in single-source single-sink networks, arguably the most basic model for flows over time. In the last decade we have witnessed significant developments in the theoretical understanding of the model. However, several fundamental questions remain open. One of the most prominent ones concerns the Price of Anarchy, measured as the worst case ratio between the minimum time required to route a given amount of flow from the source to the sink, and the time a dynamic equilibrium takes to perform the same task. Our main result states that if we could reduce the inflow of the network in a dynamic equilibrium, then the Price of Anarchy is exactly e/(e - 1) ≈ 1.582. This significantly extends a result by Bhaskar, Fleischer, and Anshelevich (SODA 2011). Furthermore, our methods allow to determine that the Price of Anarchy in parallel-link networks is exactly 4/3. Finally, we argue that if a certain very natural monotonicity conjecture holds, the Price of Anarchy in the general case is exactly e/(e - 1).
|Title of host publication||ACM EC 2019 - Proceedings of the 2019 ACM Conference on Economics and Computation|
|Publisher||Association for Computing Machinery, Inc|
|Publication status||Published - 17 Jun 2019|
|Event||20th ACM Conference on Economics and Computation, EC 2019 - Phoenix, United States|
Duration: 24 Jun 2019 → 28 Jun 2019
|Conference||20th ACM Conference on Economics and Computation, EC 2019|
|Period||24/06/19 → 28/06/19|