Nash Equilibria via Polynomial Equations
暂无分享,去创建一个
[1] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[2] K. Arrow,et al. EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY , 1954 .
[3] 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.
[4] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[5] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .
[6] Herbert E. Scarf,et al. The Approximation of Fixed Points of a Continuous Mapping , 1967 .
[7] Herbert E. Scarf,et al. The Computation of Economic Equilibria , 1974 .
[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] James Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..
[11] James Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..
[12] D. Koller,et al. Finding mixed strategies with small supports in extensive form games , 1996 .
[13] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .
[14] R. McKelvey,et al. Computation of equilibria in finite games , 1996 .
[15] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of quantifier elimination , 1996, JACM.
[16] B. Stengel,et al. COMPUTING EQUILIBRIA FOR TWO-PERSON GAMES , 1996 .
[17] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[18] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[19] B. Sturmfels. SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .
[20] Xiaotie Deng,et al. On the complexity of equilibria , 2002, STOC '02.
[21] Yishay Mansour,et al. Efficient Nash Computation in Large Population Games with Bounded Influence , 2002, UAI.
[22] Nikhil R. Devanur,et al. Market equilibrium via a primal-dual-type algorithm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[23] S. Basu,et al. Algorithms in real algebraic geometry , 2003 .
[24] Aranyak Mehta,et al. Playing large games using simple strategies , 2003, EC '03.
[25] Ruchira S. Datta. Universality of Nash Equilibria , 2003, Math. Oper. Res..
[26] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.