Author:
Brun Olivier,Prabhu Balakrishna
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference19 articles.
1. Altman, E., Basar, T., Jimenez, T., & Shimkin, N. (2002). Competitive routing in networks with polynomial costs. Automatic Control, IEEE Transactions on, 47(1), 92–96.
2. Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., & Wynter, L. (2006). A survey on networking games in telecommunications. Computers & Operations Research, 33(2), 286–311.
3. Anselmi, J., & Gaujal, B. (2010). Optimal routing in parallel, non-observable queues and the price of anarchy revisited. In 22nd International teletraffic congress (ITC), Amsterdam.
4. Ayesta, U., Brun, O., & Prabhu, B.J. (2011). Price of anarchy in non-cooperative load balancing games. Performance Evaluation, 68, 1312–1332, extended version available as LAAS Research Report. http://www.laas.fr/brun/loadbalancing.pdf
5. Brun, O., & Prabhu, B. (2012). Worst-case analysis of non-cooperative load balancing. Tech. rep., http://hal.archives-ouvertes.fr/hal-00747244
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献