Author:
Busch Costas,Magdon-Ismail Malik
Subject
General Computer Science,Theoretical Computer Science
Reference46 articles.
1. The price of stability for network design with fair cost allocation;Anshelevich;SIAM Journal on Computing,2008
2. Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler, Near-optimal network design with selfish agents, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), San Diego, California, USA, June 2003, pp. 511–520
3. The price of routing unsplittable flow;Awerbuch,2005
4. Tradeoffs in worst-case equilibria;Awerbuch,2004
5. Optimal oblivious routing in polynomial time;Azar,2003
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Coalitions in Routing Games: A Worst-Case Perspective;IEEE Transactions on Network Science and Engineering;2019-10-01
2. Polynomial Time Equilibria in Bottleneck Congestion Games;Proceedings of the 2018 ACM Conference on Economics and Computation;2018-06-11
3. Bottleneck routing with elastic demands;Operations Research Letters;2018-01
4. Routing Games With Progressive Filling;IEEE/ACM Transactions on Networking;2016-08
5. Balancing Load via Small Coalitions in Selfish Ring Routing Games;Asia-Pacific Journal of Operational Research;2015-02