Convergence time to Nash equilibrium in load balancing
暂无分享,去创建一个
[1] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[3] Ellis Horowitz,et al. A linear time approximation algorithm for multiprocessor scheduling , 1979 .
[4] Ariel Orda,et al. Competitive routing in multiuser communication networks , 1993, TNET.
[5] Ariel Orda,et al. Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[6] L. Shapley,et al. Potential Games , 1994 .
[7] Yossi Azar. On-line Load Balancing , 1996, Online Algorithms.
[8] Peter Brucker,et al. Improving Local Search Heuristics for Some Scheduling Problems-I , 1996, Discret. Appl. Math..
[9] I. Milchtaich,et al. Congestion Games with Player-Specific Payoff Functions , 1996 .
[10] L. Shapley,et al. REGULAR ARTICLEPotential Games , 1996 .
[11] Peter Brucker,et al. Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..
[12] D. Fudenberg,et al. The Theory of Learning in Games , 1998 .
[13] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[14] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[15] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[16] Petra Schuurman,et al. Performance Guarantees of Local Search for Multiprocessor Scheduling , 2001, INFORMS J. Comput..
[17] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[18] Paul G. Spirakis,et al. The price of selfish routing , 2001, STOC '01.
[19] Eitan Altman,et al. Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms , 2001, J. Parallel Distributed Comput..
[20] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[21] Eitan Altman,et al. On the Convergence to Nash Equilibrium in Problems of Distributed Computing , 2002, Ann. Oper. Res..
[22] Yishay Mansour,et al. Efficient Nash Computation in Large Population Games with Bounded Influence , 2002, UAI.
[23] Satinder Singh,et al. An Efficient Exact Algorithm for Singly Connected Graphical Games , 2002, NIPS 2002.
[24] Paul G. Spirakis,et al. The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..
[25] Martin Gairing,et al. Nashification and the Coordination Ratio for a Selfish Routing Game , 2003, ICALP.
[26] Paul G. Spirakis,et al. Selfish unsplittable flows , 2005, Theor. Comput. Sci..
[27] Vahab S. Mirrokni,et al. Convergence Issues in Competitive Games , 2004, APPROX-RANDOM.
[28] Paul W. Goldberg,et al. Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game , 2004, PODC '04.
[29] Yossi Azar,et al. The Price of Routing Unsplittable Flow , 2005, STOC '05.
[30] Yishay Mansour,et al. Fast convergence of selfish rerouting , 2005, SODA '05.