Nash Dynamics in Constant Player and Bounded Jump Congestion Games
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[2] Steve Chien,et al. Convergence to approximate Nash equilibria in congestion games , 2007, SODA '07.
[3] Alexander Skopalik,et al. On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games , 2007, WINE.
[4] Yossi Azar,et al. Fast convergence to nearly optimal solutions in potential games , 2008, EC '08.
[5] L. Shapley,et al. REGULAR ARTICLEPotential Games , 1996 .
[6] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[7] Berthold Vöcking,et al. Inapproximability of pure nash equilibria , 2008, STOC.
[8] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[9] Xi Chen,et al. Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[10] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[11] Christos H. Papadimitriou,et al. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..
[12] Berthold Vöcking,et al. On the Impact of Combinatorial Structure on Congestion Games , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[13] É. Tardos,et al. Algorithmic Game Theory: Network Formation Games and the Potential Function Method , 2007 .
[14] Adrian Vetta,et al. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[15] L. Shapley,et al. Potential Games , 1994 .
[16] Vahab S. Mirrokni,et al. Convergence and approximation in potential games , 2006, Theor. Comput. Sci..
[17] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[18] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[19] Mihalis Yannakakis,et al. Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..
[20] Marina Thottan,et al. Market sharing games applied to content distribution in ad hoc networks , 2004, IEEE Journal on Selected Areas in Communications.
[21] Fan Chung Graham,et al. Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.