On the Price of Anarchy for Flows over Time

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

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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 bounded by a factor, parameterized by the longest path length, that converges to e/(e − 1) ≈ 1.582 and this is tight. This significantly extends a result by Bhaskar, Fleischer, and Anshelevich (SODA 2011). Furthermore, our methods allow us to determine that the Price of Anarchy in parallel-link and parallel-path 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).
Original languageEnglish
Number of pages24
JournalMathematics of Operations Research
Publication statusE-pub ahead of print - 2021

Keywords

  • flows over time
  • price of anarchy
  • dynamic equilibrium
  • On the Price of Anarchy for flows over time

    Correa, J., Cristi, A. & Oosterwijk, T., Jul 2019, EC '19 Proceedings of the 2019 ACM Conference on Economics and Computation. ACM New York, p. 559-577 19 p.

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

    Open Access
    File
    172 Downloads (Pure)

Cite this