Computing an Extensive-Form Perfect Equilibrium in Two-Player Games

Equilibrium computation in games is currently considered one of the most challenging issues in AI. In this paper, we provide, to the best of our knowledge, the first algorithm to compute a Selten's extensive–form perfect equilibrium (EFPE) with two–player games. EFPE refines the Nash equilibrium requiring the equilibrium to be robust to slight perturbations of both players' behavioral strategies. Our result puts the computation of an EFPE into the PPAD class, leaving open the question whether or not the problem is hard. Finally, we experimentally evaluate the computational time spent to find an EFPE and some relaxations of EFPE.

[1]  Nicola Gatti,et al.  Local search techniques for computing equilibria in two-player general-sum strategic-form games , 2010, AAMAS.

[2]  Javier Peña,et al.  Smoothing Techniques for Computing Nash Equilibria of Sequential Games , 2010, Math. Oper. Res..

[3]  Jean-François Mertens.  Two examples of strategic equilibrium , 1995 .

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

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

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

[7]  Aranyak Mehta,et al.  A Note on Approximate Nash Equilibria , 2006, WINE.

[8]  Xi Chen,et al.  Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[9]  Troels Bjerre Lund,et al.  Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker , 2007, AAAI.

[10]  Yoav Shoham,et al.  Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..

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

[12]  L. Hesselholt,et al.  Higher Algebra , 1937, Nature.

[13]  Peter Bro Miltersen,et al.  Computing a quasi-perfect equilibrium of a two-player game , 2010 .

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

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

[16]  Tuomas Sandholm,et al.  Lossless abstraction of imperfect information games , 2007, JACM.

[17]  Vincent Conitzer,et al.  Mixed-Integer Programming Methods for Finding Nash Equilibria , 2005, AAAI.

[18]  B. Stengel.  Algorithmic Game Theory: Equilibrium Computation for Two-Player Games in Strategic and Extensive Form , 2007 .