On the Price of Anarchy of Highly Congested Nonatomic Network Games-Reference-Cited by-同舟云学术

On the Price of Anarchy of Highly Congested Nonatomic Network Games

Published:2016 Issue: Volume: Page:117-128
ISSN:0302-9743
Container-title:Algorithmic Game Theory
language:
Short-container-title:

Author:

Colini-Baldeschi Riccardo,Cominetti Roberto,Scarsini Marco

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-53354-3_10

Reference32 articles.

1. Attouch, H.: Variational Convergence for Functions and Operators. Pitman, Boston (1984)

2. Beckmann, M.J., McGuire, C., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)

3. Bingham, N.H., Goldie, C.M., Teugels, J.L.: Regular Variation, Encyclopedia of Mathematics and its Applications, vol. 27. Cambridge University Press, Cambridge (1989)

4. Cole, R., Tao, Y.: The price of anarchy of large Walrasian auctions. Technical report, arXiv:1508.07370v4 (2015). http://arxiv.org/abs/1508.07370

5. Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961–976 (2004). http://dx.doi.org/10.1287/moor.1040.0098

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

1. Congestion-Mitigating Spatiotemporal Routing in Road Networks;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games;Mathematics of Operations Research;2022-09-30

3. A convergence analysis of the price of anarchy in atomic congestion games;Mathematical Programming;2022-06-28

4. Selfishness Need Not Be Bad;Operations Research;2021-03

5. When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic;Operations Research;2020-03-02