A Network Game of Dynamic Traffic-Reference-Cited by-同舟云学术

A Network Game of Dynamic Traffic

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

Author:

Cao Zhigang¹,Chen Bo²,Chen Xujin¹,Wang Changjun³

Affiliation:

1. Chinese Academy of Sciences, Beijing, China

2. University of Warwick, Coventry, United Kingdom

3. Beijing University of Technology, Beijing, China

Funder

National Natural Science Foundation of China (NSFC)

Publisher

ACM

Link

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

Reference5 articles.

1. Competitive routing over time

2. Nash Equilibria and the Price of Anarchy for Flows over Time

3. Scarsini M. Schröder M. and Tomala T. 2016. Dynamic atomic congestion games with seasonal flows. HEC Paris Research Paper No. ECO/SCD-2013-1016. Available at SSRN: https://ssrn.com/abstract=2278203 or Scarsini M. Schröder M. and Tomala T. 2016. Dynamic atomic congestion games with seasonal flows. HEC Paris Research Paper No. ECO/SCD-2013-1016. Available at SSRN: https://ssrn.com/abstract=2278203 or

4. Atomic routing in a deterministic queuing model

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

1. 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

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

3. Bounding Residence Times for Atomic Dynamic Routings;Mathematics of Operations Research;2022-11

4. Convergence of a Packet Routing Model to Flows over Time;Mathematics of Operations Research;2022-10-26

5. A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows;Mathematical Programming;2022-02-10