Universality of Nash Equilibria
暂无分享,去创建一个
[1] J. Rosenmüller. On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games , 1971 .
[2] P. Gritzmann,et al. Applied geometry and discrete mathematics : the Victor Klee festschrift , 1991 .
[3] Gunter M. Ziegler,et al. Realization spaces of 4-polytopes are universal , 1995 .
[4] R. McKelvey,et al. Computation of equilibria in finite games , 1996 .
[5] J. Harsanyi. Oddness of the number of equilibrium points: A new proof , 1973 .
[6] John,et al. Real Algebraic Manifolds , 1952 .
[7] Scuola Normale Superiore,et al. Su una congettura di Nash , 1973 .
[8] Andrew J. Sommese,et al. Numerical Homotopies to Compute Generic Points on Positive Dimensional Algebraic Sets , 2000, J. Complex..
[9] Andrew McLennan,et al. The Maximal Number of Regular Totally Mixed Nash Equilibria , 1997 .
[10] Jan Verschelde,et al. Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation , 1999, TOMS.
[11] Peter W. Shor,et al. Stretchability of Pseudolines is NP-Hard , 1990, Applied Geometry And Discrete Mathematics.
[12] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[13] Selman Akbulut,et al. Topology of Real Algebraic Sets , 1991 .
[14] Shigefumi Mori,et al. Threefolds Whose Canonical Bundles Are Not Numerically Effective (Recent Topics in Algebraic Geometry) , 1980 .
[15] Dinesh Manocha,et al. SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .
[16] Annali della R. Scuola Normale Superiore di Pisa , 1889 .
[17] Robert Wilson,et al. Computing Equilibria of N-Person Games , 1971 .
[18] N. Mnev. The universality theorems on the classification problem of configuration varieties and convex polytopes varieties , 1988 .
[19] E. Kalai,et al. Rational Learning Leads to Nash Equilibrium , 1993 .
[20] B. Sturmfels. SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .