Query complexity of approximate nash equilibria

We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players n and a constant number of actions m. Our main result states that even for constant ε, the query complexity of an ε-well-supported Nash equilibrium is exponential in n.

[1]  J. Hofbauer,et al.  Uncoupled Dynamics Do Not Lead to Nash Equilibrium , 2003 .

[2]  S. Hart.  Adaptive Heuristics , 2005 .

[3]  John Fearnley,et al.  Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries , 2013, ACM Trans. Economics and Comput..

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

[5]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[6]  Vincent Conitzer,et al.  Communication complexity as a lower bound for learning in games , 2004, ICML.

[7]  A. Razborov.  Communication Complexity , 2011 .

[8]  Xiaotie Deng,et al.  Matching algorithmic bounds for finding a Brouwer fixed point , 2008, JACM.

[9]  Ronald L. Graham,et al.  Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions , 1990, Random Struct. Algorithms.

[10]  Aviad Rubinstein.  Computational Complexity of Approximate Nash Equilibrium in Large Games , 2014, ArXiv.

[11]  Dean P. Foster,et al.  Regret in the On-Line Decision Problem , 1999 .

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

[13]  Aranyak Mehta,et al.  A note on approximate Nash equilibria , 2006, Theor. Comput. Sci..

[14]  Yakov Babichenko,et al.  Simple approximate equilibria in large games , 2014, EC.

[15]  Manfred K. Warmuth,et al.  The Weighted Majority Algorithm , 1994, Inf. Comput..

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

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

[18]  Christos H. Papadimitriou,et al.  Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[19]  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).

[20]  Andreu Mas-Colell,et al.  Stochastic Uncoupled Dynamics and Nash Equilibrium , 2004, Games Econ. Behav..

[21]  Paul W. Goldberg,et al.  Learning equilibria of games via payoff queries , 2013, EC '13.

[22]  Xi Chen,et al.  Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[23]  J. Robinson.  AN ITERATIVE METHOD OF SOLVING A GAME , 1951, Classics in Game Theory.

[24]  Sham M. Kakade,et al.  (weak) Calibration is Computationally Hard , 2012, COLT.

[25]  Aranyak Mehta,et al.  Playing large games using simple strategies , 2003, EC '03.

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

[27]  Paul W. Goldberg,et al.  Bounds for the Query Complexity of Approximate Equilibria , 2016, ACM Trans. Economics and Comput..

[28]  William H. Sandholm,et al.  Population Games And Evolutionary Dynamics , 2010, Economic learning and social evolution.

[29]  Eyal Kushilevitz,et al.  Communication Complexity: Index of Notation , 1996 .

[30]  Yakov Babichenko,et al.  Approximate Nash Equilibria via Sampling , 2013, ArXiv.

[31]  Aviad Rubinstein,et al.  Inapproximability of Nash Equilibrium , 2014, STOC.

[32]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[33]  Yakov Babichenko,et al.  Query Complexity of Correlated Equilibrium , 2013, ACM Trans. Economics and Comput..

[34]  S. Hart,et al.  A simple adaptive procedure leading to correlated equilibrium , 2000 .

[35]  L. Blume.  The Statistical Mechanics of Strategic Interaction , 1993 .

[36]  Sham M. Kakade,et al.  Deterministic calibration and Nash equilibrium , 2004, J. Comput. Syst. Sci..