Convergence Time to Nash Equilibria
暂无分享,去创建一个
[1] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[2] I. Borosh,et al. Bounds on positive integral solutions of linear Diophantine equations , 1976 .
[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[4] Ellis Horowitz,et al. A linear time approximation algorithm for multiprocessor scheduling , 1979 .
[5] Ariel Orda,et al. Competitive routing in multiuser communication networks , 1993, TNET.
[6] Ariel Orda,et al. Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[7] Deborah Estrin,et al. Pricing in computer networks: motivation, formulation, and example , 1993, TNET.
[8] S. Shenker. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1994, SIGCOMM.
[9] L. Shapley,et al. Potential Games , 1994 .
[10] D. Hearn,et al. Chapter 6 Network equilibrium models and algorithms , 1995 .
[11] Aurel A. Lazar,et al. On the existence of equilibria in noncooperative optimal flow control , 1995, JACM.
[12] Ariel Orda,et al. Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.
[13] I. Milchtaich,et al. Congestion Games with Player-Specific Payoff Functions , 1996 .
[14] L. Shapley,et al. REGULAR ARTICLEPotential Games , 1996 .
[15] Peter Brucker,et al. Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..
[16] Richard J. La,et al. Optimal routing control: game theoretic approach , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.
[17] D. Fudenberg,et al. The Theory of Learning in Games , 1998 .
[18] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[19] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[20] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[21] Petra Schuurman,et al. Performance Guarantees of Local Search for Multiprocessor Scheduling , 2001, INFORMS J. Comput..
[22] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[23] Eitan Altman,et al. Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms , 2001, J. Parallel Distributed Comput..
[24] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[25] Eitan Altman,et al. On the Convergence to Nash Equilibrium in Problems of Distributed Computing , 2002, Ann. Oper. Res..
[26] Yishay Mansour,et al. Efficient Nash Computation in Large Population Games with Bounded Influence , 2002, UAI.
[27] Satinder Singh,et al. An Efficient Exact Algorithm for Singly Connected Graphical Games , 2002, NIPS 2002.
[28] Paul G. Spirakis,et al. The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..