Polynomial computation of exact correlated equilibrium in compact games

In a landmark paper, Papadimitriou and Roughgarden described a polynomial-time algorithm ("Ellipsoid Against Hope") for computing sample correlated equilibria of concisely-represented games. Recently, Stein, Parrilo and Ozdaglar showed that this algorithm can fail to find an exact correlated equilibrium, but can be easily modified to efficiently compute approximate correlated equilibria. It remained an open problem to determine whether the algorithm can be modified to compute an exact correlated equilibrium. In a new paper, we showed that it can, presenting a variant of the Ellipsoid Against Hope algorithm that guarantees the polynomial-time identification of exact correlated equilibrium. Our new algorithm differs from the original primarily in its use of a separation oracle that produces cuts corresponding to pure-strategy profiles. As a result, we no longer face the numerical precision issues encountered by the original approach, and both the resulting algorithm and its analysis are considerably simplified. Our new separation oracle can be understood as a derandomization of Papadimitriou and Roughgarden's original separation oracle via the method of conditional expectations.

[1]  R. Aumann.  Subjectivity and Correlation in Randomized Strategies , 1974 .

[2]  J. Neumann,et al.  Theory of Games and Economic Behavior. , 1945 .

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

[4]  Paul W. Goldberg,et al.  Reducibility among equilibrium problems , 2006, STOC '06.

[5]  Richard M. Karp,et al.  On linear characterizations of combinatorial optimization problems , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[6]  Wan Huang,et al.  Equilibrium Computation for Extensive Games , 2011 .

[7]  Paul Erdös,et al.  On a Combinatorial Game , 1973, J. Comb. Theory, Ser. A.

[8]  R. Myerson.  Dual Reduction and Elementary Games , 1997 .

[9]  Bernhard von Stengel,et al.  Computing an Extensive-Form Correlated Equilibrium in Polynomial Time , 2008, WINE.

[10]  Sergiu Hart,et al.  Existence of Correlated Equilibria , 1989, Math. Oper. Res..

[11]  Tim Roughgarden,et al.  Comment on “Computing Correlated Equilibria in Multi-Player Games” , 2010 .

[12]  Robert Wilson,et al.  A global Newton method to compute Nash equilibria , 2003, J. Econ. Theory.

[13]  Kevin Leyton-Brown,et al.  Polynomial-time computation of exact correlated equilibrium in compact games , 2010, EC '11.

[14]  K. McCardle,et al.  Coherent behavior in noncooperative games , 1990 .

[15]  Christos H. Papadimitriou,et al.  Three-Player Games Are Hard , 2005, Electron. Colloquium Comput. Complex..

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

[17]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[18]  Kevin Leyton-Brown,et al.  Computing Nash Equilibria of Action-Graph Games , 2004, UAI.

[19]  Xiaotie Deng,et al.  Settling the complexity of computing two-player Nash equilibria , 2007, JACM.

[20]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[21]  Christos H. Papadimitriou,et al.  Computing correlated equilibria in multi-player games , 2005, STOC '05.

[22]  R. Aumann.  Correlated Equilibrium as an Expression of Bayesian Rationality Author ( s ) , 1987 .

[23]  Bernhard von Stengel,et al.  Extensive-Form Correlated Equilibrium: Definition and Computational Complexity , 2008, Math. Oper. Res..

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

[25]  Tim Roughgarden,et al.  Computing equilibria in multi-player games , 2005, SODA '05.

[26]  Yishay Mansour,et al.  How long to equilibrium? The communication complexity of uncoupled equilibrium procedures , 2010, Games Econ. Behav..

[27]  Pablo A. Parrilo,et al.  Exchangeable equilibria contradict exactness of the Papadimitriou-Roughgarden algorithm , 2010, ArXiv.

[28]  Kevin Leyton-Brown,et al.  Action-Graph Games , 2011, Games Econ. Behav..

[29]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[30]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[31]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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