Computation of equilibria in finite games

[1]  R. McKelvey,et al.  Quantal Response Equilibria for Extensive Form Games , 1998 .

[2]  R. McKelvey.  A Liapunov Function for Nash Equilibria , 1998 .

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

[4]  B. Stengel,et al.  Efficient Computation of Behavior Strategies , 1996 .

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

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

[7]  Bernd Sturmfels,et al.  A polyhedral method for solving sparse polynomial systems , 1995 .

[8]  R. McKelvey,et al.  Quantal Response Equilibria for Normal Form Games , 1995 .

[9]  Dolf Talman,et al.  Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems , 1994, Math. Methods Oper. Res..

[10]  Lawrence E. Blume,et al.  The Algebraic Geometry of Perfect and Sequential Equilibrium , 1994 .

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

[12]  G. Myles.  Journal of Economic Theory: J.-M. Grandmont, 1992, Transformations of the commodity space, behavioural heterogeneity, and the aggregation problem 57, 1-35 , 1993 .

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

[14]  Thomas R. Palfrey,et al.  A Bayesian Sequential Experimental Study of Learning in Games , 1993 .

[15]  John F. Canny,et al.  An Efficient Algorithm for the Sparse Mixed Resultant , 1993, AAECC.

[16]  Todd R. Kaplan,et al.  A Program for Finding Nash Equilibria , 1993 .

[17]  D. Koller,et al.  The complexity of two-person zero-sum games in extensive form , 1992 .

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

[19]  R. McKelvey,et al.  An experimental study of the centipede game , 1992 .

[20]  M. Kostreva,et al.  A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games , 1991 .

[21]  William R. Zame,et al.  The Algebraic Geometry of Games and the Tracing Procedure , 1991 .

[22]  Patrick T. Harker,et al.  Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications , 1990, Math. Program..

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

[24]  M. M. Kostreva,et al.  Nonconvexity in noncooperative game theory , 1989 .

[25]  T. M. Doup,et al.  Simplicial Algorithms on the Simplotope , 1988 .

[26]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

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

[28]  In-Koo Cho,et al.  A Refinement of Sequential Equilibrium , 1987 .

[29]  A. Talman,et al.  Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling , 1987 .

[30]  Dolf Talman,et al.  A Continuous Deformation Algorithm on the Product Space of Unit Simplices , 1987, Math. Oper. Res..

[31]  Gerard van der Laan,et al.  Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds , 1987, Math. Program..

[32]  Dolf Talman,et al.  A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices , 1987, Math. Program..

[33]  J. Sobel,et al.  Equilibrium Selection in Signaling Games , 1987 .

[34]  David M. Kreps,et al.  Signaling Games and Stable Equilibria , 1987 .

[35]  Lars Mathiesen,et al.  An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example , 1987, Math. Program..

[36]  Ephraim Feig,et al.  A fast parallel algorithm for determining all roots of a polynomial with real roots , 1986, STOC '86.

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

[38]  A. McLennan.  Justifiable Beliefs in Sequential Equilibrium , 1985 .

[39]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[40]  E. Kalai,et al.  Persistent equilibria in strategic games , 1984 .

[41]  Rs Stainton.  Pathways to solutions , 1984 .

[42]  R. Kellogg,et al.  Pathways to solutions, fixed points, and equilibria , 1983 .

[43]  Michael J. Todd.  On the computational complexity of piecewise-linear homotopy algorithms , 1982, Math. Program..

[44]  Gerard van der Laan,et al.  On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games , 1982, Math. Oper. Res..

[45]  Anthony V. Fiacco,et al.  Extremal Methods and Systems Analysis , 1980 .

[46]  W. I. Zangwill,et al.  Global Continuation Methods for Finding all Solutions to Polynomial Systems of Equations in N Variables , 1980 .

[47]  C. B. García,et al.  Finding all solutions to polynomial systems and other systems of equations , 1979, Math. Program..

[48]  Gerard van der Laan,et al.  A restart algorithm for computing fixed points without an extra dimension , 1979, Math. Program..

[49]  R. Myerson.  Refinements of the Nash equilibrium concept , 1978 .

[50]  K. G. Murty.  Computational complexity of complementary pivot methods , 1978 .

[51]  R. Saigal.  On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting , 1977, Math. Oper. Res..

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

[53]  M. Todd.  The Computation of Fixed Points and Applications , 1976 .

[54]  H. Kuhn,et al.  Sandwich method for finding fixed points , 1975 .

[55]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[56]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[57]  H. Scarf,et al.  The Computation of Economic Equilibria , 1974 .

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

[59]  C. E. Lemke,et al.  Simplicial Approximation of an Equilibrium Point for Non-Cooperative N-Person Games , 1973 .

[60]  L. Shapley.  On Balanced Games Without Side Payments , 1973 .

[61]  Francesco Mallegni,et al.  The Computation of Economic Equilibria , 1973 .

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

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

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

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

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

[67]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

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

[69]  O. Mangasarian.  Equilibrium Points of Bimatrix Games , 1964 .

[70]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

[71]  S. Vajda,et al.  Contribution to the Theory of Games , 1951 .

[72]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[73]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[74]  J. Neumann,et al.  SOLUTIONS OF GAMES BY DIFFERENTIAL EQUATIONS , 1950 .

[75]  A. B. BASSET,et al.  Modern Algebra , 1905, Nature.

[76]  W. Browder,et al.  Annals of Mathematics , 1889 .

[77]  Common Rationality and the Choice Among Solutions : an experimental analysis of the Centipede Game , 2022 .