Author:
Even-Dar Eyal,Kesselman Alex,Mansour Yishay
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. E. Altman, T. Basar, T. Jimenez and N. Shimkin, “Routing into two parallel links: Game-Theoretic Distributed Algorithms,” Journal of Parallel and Distributed Computing, pp. 1367–1381, Vol. 61, No. 9, 2001.
2. B. Awerbuh, Y. Azar, and Y. Richter, “Analysis of worse case Nash equilibria for restricted assignment,” unpublished manuscript.
3. Y. Azar, “On-line Load Balancing Online Algorithms — The State of the Art,” chapter 8, 178–195, Springer, 1998.
4. T. Boulogne, E. Altman and O. Pourtallier, “On the convergence to Nash equilibrium in problems of distributed computing,” Annals of Operation research, 2002.
5. P. Brucker, J. Hurink, and F. Werner, “Improving Local Search Heuristics for Some Scheduling Problems, Part I,” Discrete Applied Mathematics, 65, pp. 97–122, 1996.
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献