On the Price of Anarchy for flows over time-Reference-Cited by-同舟云学术

On the Price of Anarchy for flows over time

Published:2019-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2019 ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Correa José¹,Cristi Andrés¹,Oosterwijk Tim²

Affiliation:

1. Universidad de Chile, Santiago, Chile

2. Maastricht University, Maastricht, Netherlands

Funder

Consejo Nacional de Innovación, Ciencia y Tecnología

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3328526.3329593

Reference31 articles.

1. nderson E.J. Philpott A.B. Optimisation of flows in networks over time.In F. P. Kelly editor Probability Statistics and Optimisation Wiley New York 369--382 1994. nderson E.J. Philpott A.B. Optimisation of flows in networks over time.In F. P. Kelly editor Probability Statistics and Optimisation Wiley New York 369--382 1994.

2. haskar U. Fleischer L. Anshelevich E. A Stackelberg strategy for routing flow over time.SODA 2011. haskar U. Fleischer L. Anshelevich E. A Stackelberg strategy for routing flow over time.SODA 2011.

3. A Stackelberg strategy for routing flow over time

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bicriteria Nash flows over time;Games and Economic Behavior;2024-09

2. Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Atomic Dynamic Routing Games with Multiple Destinations;Journal of the Operations Research Society of China;2023-07-01

4. Bridging the user equilibrium and the system optimum in static traffic assignment: a review;4OR;2023-04-03

5. The Price of Anarchy for Instantaneous Dynamic Equilibria;Mathematics of Operations Research;2023-01-06