### Playing large games using simple strategies

暂无分享，去创建一个

[1] H W Kuhn,et al. AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES. , 1961, Proceedings of the National Academy of Sciences of the United States of America.

[2] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[3] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[4] Herbert E. Scarf,et al. The Approximation of Fixed Points of a Continuous Mapping , 1967 .

[5] T. Raghavan. Completely Mixed Strategies in Bimatrix Games , 1970 .

[6] Robert Wilson,et al. Computing Equilibria of N-Person Games , 1971 .

[7] J. Rosenmüller. On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games , 1971 .

[8] Christos H. Papadimitriou,et al. Exponential lower bounds for finding Brouwer fixed points , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[9] Eitan Zemel,et al. Nash and correlated equilibria: Some complexity considerations , 1989 .

[10] A. P. Jurg,et al. Some topics in the theory of bimatrix games , 1993 .

[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] I. Althöfer. On sparse approximations to randomized strategies and convex combinations , 1994 .

[13] Richard J. Lipton,et al. Simple strategies for large zero-sum games with applications to complexity theory , 1994, STOC '94.

[14] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.

[15] Shlomo Zilberstein,et al. Models of Bounded Rationality , 1995 .

[16] D. Koller,et al. Finding mixed strategies with small supports in extensive form games , 1996 .

[17] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .

[18] R. McKelvey,et al. Computation of equilibria in finite games , 1996 .

[19] B. Stengel,et al. COMPUTING EQUILIBRIA FOR TWO-PERSON GAMES , 1996 .

[20] H. Kuk. On equilibrium points in bimatrix games , 1996 .

[21] A. Rubinstein. Modeling Bounded Rationality , 1998 .

[22] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.

[23] Eric van Damme,et al. Non-Cooperative Games , 2000 .

[24] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[25] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.

[26] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.

[27] Michael L. Littman,et al. An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games , 2001, NIPS.

[28] Yishay Mansour,et al. Efficient Nash Computation in Large Population Games with Bounded Influence , 2002, UAI.

[29] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.

[30] 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..

[31] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.