Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference37 articles.
1. Lecture Notes in Computer Science;S. Aland,2006
2. Altman, E., Basar, T., Jimnez, T., Shimkin, N.: Competitive routing in networks with polynomial costs. IEEE Trans. Autom. Control 47, 92–96 (2002)
3. Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing, pp. 57–66. ACM, New York (2005)
4. Bhaskar, U., Fleischer, L., Hoy, D., Huang, C.: Equilibria of atomic flow games are not unique. In: Proc. of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 748–757. SIAM, Philadelphia (2009)
5. Bhaskar, U., Fleischer, L., Huang, C.: The price of collusion in series-parallel networks. In Proc. of the 14th International IPCO Conference Integer Programming and Combinatorial Optimization. Springer (2010, to appear)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献