Graphical Congestion Games-Reference-Cited by-同舟云学术

Graphical Congestion Games

Published:2008 Issue: Volume: Page:70-81
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bilò Vittorio,Fanelli Angelo,Flammini Michele,Moscardelli Luca

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-92185-1_16

Reference17 articles.

1. Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proc. of STOC, pp. 57–66. ACM Press, New York (2005)

2. Beier, R., Czumaj, A., Krysta, P., Vocking, B.: Computing Equilibria for Congestion Games with (Im)perfect Information. In: Proc. of SODA, pp. 746–755. ACM Press, New York (2004)

3. Lecture Notes in Computer Science;I. Caragiannis,2006

4. Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proc. of STOC, pp. 67–73. ACM Press, New York (2005)

5. Lecture Notes in Computer Science;G. Christodoulou,2005

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

1. Distributed Caching Algorithms for Interconnected Operator CDNs;IEEE Journal on Selected Areas in Communications;2017-02

2. Potential Functions in Strategic Games;Computer Science – Theory and Applications;2013

3. Convergence in Player-Specific Graphical Resource Allocation Games;IEEE Journal on Selected Areas in Communications;2012-12

4. Atomic Congestion Games on Graphs and Their Applications in Networking;IEEE/ACM Transactions on Networking;2012-10

5. Competitive routing over time;Theoretical Computer Science;2011-09