The Computation of Perfect and Proper Equilibrium for Finite Games via Simulated Annealing

This paper exploits an analogy between the “trembles” that underlie the functioning of simulated annealing and the player “trembles” that underlie the Nash refinements known as perfect and proper equilibrium. This paper shows that this relationship can be used to provide a method for computing perfect and proper equilibria of n-player strategic games. This paper also shows, by example, that simulated annealing can be used to locate a perfect equilibrium in an extensive form game.

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

[2]  H. W. Kuhn,et al.  11. Extensive Games and the Problem of Information , 1953 .

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

[4]  Dolf Talman,et al.  An Algorithmic Approach toward the Tracing Procedure for Bi-matrix Games , 1999 .

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  R. Selten.  The chain store paradox , 1978 .

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

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

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

[10]  J. Besag.  Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

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

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

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

[14]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

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

[16]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

[18]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[19]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

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

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

[22]  R. Selten.  Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.

[23]  Walter R. Gilks,et al.  Full conditional distributions , 1995 .

[24]  J. Harsanyi.  The tracing procedure: A Bayesian approach to defining a solution forn-person noncooperative games , 1975 .

[25]  E. Vandamme.  Stability and perfection of nash equilibria , 1987 .

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

[27]  Stuart McDonald,et al.  Using simulated annealing to calculate the trembles of trembling hand perfection , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[28]  Bernhard von Stengel,et al.  Computing Normal Form Perfect Equilibria for Extensive Two-Person Games , 2002 .

[29]  E. Damme.  Stability and perfection of Nash equilibria , 1987 .

[30]  Dolf Talman,et al.  A procedure for finding Nash equilibria in bi-matrix games , 1991, ZOR Methods Model. Oper. Res..

[31]  Sylvia Richardson,et al.  Markov chain concepts related to sampling algorithms , 1995 .

[32]  J. Friedman.  Game theory with applications to economics , 1986 .