Activities per year
Abstract
Dynamic network flows, or network flows over time, constitute an important model for realworld 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 gametheoretic perspective. In this paper we study dynamic equilibria in the deterministic fluid queuing model in singlesource singlesink 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 parallellink 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 language  English 

Title of host publication  EC '19 Proceedings of the 2019 ACM Conference on Economics and Computation 
Publisher  ACM New York 
Pages  559577 
Number of pages  19 
ISBN (Print)  9781450367929 
DOIs  
Publication status  Published  Jul 2019 
Event  20th ACM Conference on Economics and Computation  Phoenix, United States Duration: 24 Jun 2019 → 28 Jun 2019 Conference number: 19 http://www.sigecom.org/ec19/ 
Conference
Conference  20th ACM Conference on Economics and Computation 

Abbreviated title  EC 
Country/Territory  United States 
City  Phoenix 
Period  24/06/19 → 28/06/19 
Internet address 
JEL classifications
 c72  Noncooperative Games
 d85  Network Formation and Analysis: Theory
Keywords
 flows over time
 price of anarchy
 dynamic equilibrium
Datasets

Computational experiments for the monotonicity conjecture for Flows over Time
Oosterwijk, T. (Creator), Maastricht University, 2020
https://drive.google.com/open?id=1BTxc7J4I0uS1mglBcgT8BlPCCd8abB and one more link, https://drive.google.com/open?id=1Rp_brX85lDr0ndrG1Fdwe6EoOqSZeJy (show fewer)
Dataset
Activities
 2 Talk or presentation

On the Price of Anarchy for Flows over Time
Tim Oosterwijk (Speaker)
13 Feb 2020 → 14 Feb 2020Activity: Talk or presentation (speaker at event) › Talk or presentation › Academic

Price of Anarchy (and Monotonicity)
Tim Oosterwijk (Speaker)
20 Sep 2020 → 25 Sep 2020Activity: Talk or presentation (speaker at event) › Talk or presentation › Academic