A global Newton method to compute Nash equilibria

Abstract A new algorithm is presented for computing Nash equilibria of finite games. Using Kohlberg and Mertens’ structure theorem we show that a homotopy method can be represented as a dynamical system and implemented by Smale's global Newton method. The algorithm is outlined and computational experience is reported.

[1]  Yves Balasko Foundations of the theory of general equilibrium , 1988 .

[2]  J. Tomlin Robust implementation of Lemke's method for the linear complementarity problem , 1978 .

[3]  J. Mertens,et al.  ON THE STRATEGIC STABILITY OF EQUILIBRIA , 1986 .

[4]  Robert Wilson Computing Simply Stable Equilibria , 1992 .

[5]  Ennio Stacchetti,et al.  A Bound on the Proportion of Pure Strategy Equilibria in Generic Games , 1993, Math. Oper. Res..

[6]  Srihari Govindan,et al.  Equivalence and Invariance of the Index and Degree of Nash Equilibria , 1997 .

[7]  B. Eaves A Course in Triangulations for Solving Equations with Deformations , 1984 .

[8]  Robert Wilson,et al.  Structure theorems for game trees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Robert Wilson,et al.  Computing Nash equilibria by iterated polymatrix approximation , 2004 .

[10]  John C. Harsanyi,et al.  Общая теория выбора равновесия в играх / A General Theory of Equilibrium Selection in Games , 1989 .

[11]  M. Hirsch A proof of the nonretractibility of a cell onto its boundary , 1963 .

[12]  Robert W. Rosenthal,et al.  Bayesian Equilibria of Finite Two-Person Games with Incomplete Information , 1974 .

[13]  Donald C. Keenan Further remarks on the Global Newton method , 1981 .

[14]  S. Smale Convergent process of price adjust-ment and global newton methods , 1976 .

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

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

[17]  Bernhard von Stengel New lower bounds for the number of equilibria in bimatrix games , 1997 .

[18]  B. Curtis Eaves,et al.  Homotopies for computation of fixed points , 1972, Math. Program..

[19]  L. Shapley A note on the Lemke-Howson algorithm , 1974 .

[20]  Yoshitsugu Yamamoto,et al.  A path-following procedure to find a proper equilibrium of finite games , 1993 .

[21]  B. C. Eaves,et al.  Equivalence of LCP and PLS , 1981, Math. Oper. Res..

[22]  M. Hirsch,et al.  On Algorithms for Solving f(x)=0 , 1979 .

[23]  Herbert E. Scarf,et al.  The Computation of Economic Equilibria , 1974 .

[24]  M. Postnikov Lectures in algebraic topology , 1983 .

[25]  Robert Wilson Computing Equilibria of Two-Person Games from the Extensive Form , 1972 .

[26]  B. Curtis Eaves,et al.  Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..

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

[28]  Jean-François Mertens Stable Equilibria - A Reformulation: Part I. Definition and Basic Properties , 1989, Math. Oper. Res..

[29]  Robert Wilson,et al.  Direct proofs of generic finiteness of nash equilibrium outcomes , 2001 .

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

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

[32]  Ronald Peeters,et al.  A differentiable homotopy to compute Nash equilibria of n-person games , 2000 .

[33]  Robert Wilson The Bilinear Complementarity Problem and Competitive Equilibria of Piecewise Linear Economic Models , 1978 .

[34]  B. Eaves,et al.  General equilibrium models and homotopy methods , 1999 .