On the efficiency of non-cooperative load balancing
暂无分享,去创建一个
[1] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[2] Tim Roughgarden,et al. Selfish routing and the price of anarchy , 2005 .
[3] S. Stidham,et al. Individual versus Social Optimization in the Allocation of Customers to Alternative Servers , 1983 .
[4] L. Shapley,et al. Potential Games , 1994 .
[5] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .
[6] Balakrishna J. Prabhu,et al. Price of anarchy in non-cooperative load balancing games , 2011, Perform. Evaluation.
[7] Ariel Orda,et al. Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.
[8] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[9] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[10] Tim Roughgarden,et al. The price of anarchy in an exponential multi-server , 2007, Oper. Res. Lett..
[11] Ariel Orda,et al. Achieving network optima using Stackelberg routing strategies , 1997, TNET.
[12] Balakrishna J. Prabhu,et al. Price of Anarchy in Non-Cooperative Load Balancing , 2010, 2010 Proceedings IEEE INFOCOM.
[13] Adam Wierman,et al. The effect of local scheduling in load balancing designs , 2008, PERV.
[14] Tim Roughgarden,et al. Fully Distributed Algorithms for Convex Optimization Problems , 2007, SIAM J. Optim..