Author:
Christodoulou George,Koutsoupias Elias,Nanavati Akash
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Archer, A., Tardos, E.: Frugal Path Mechanisms. In: ACM-SIAM SODA (2002)
2. Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing. In: ACM EC, pp. 98–107 (2003)
3. Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: ACM STOC, pp. 521–530 (2003)
4. Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM J. Comput. 9(1), 91–103 (1980)
5. Czumaj, A., Vöcking, B.: Tight Bounds for Worst-case Equilibria. In: ACM-SIAM SODA, pp. 413–420 (2002)
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献