Computing Equilibria in Anonymous Games

We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentiate between other players. Our results pertain to such games with many players but few strategies. We show that any such game has an approximate pure Nash equilibrium, computable in polynomial time, with approximation O(s2lambda), where s is the number of strategies and lambda is the Lipschitz constant of the utilities. Finally, we show that there is a PTAS for finding an isin-approximate Nash equilibrium when the number of strategies is two.

[1]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[2]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[3]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[4]  Eli Upfal,et al.  Constructing disjoint paths on expander graphs , 1987, Comb..

[5]  Noga Alon,et al.  Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[6]  A. Barbour,et al.  Poisson Approximation , 1992 .

[7]  Alan M. Frieze,et al.  Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..

[8]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[9]  Malgorzata Roos,et al.  Compound Poisson approximation in reliability theory , 1995 .

[10]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[12]  Aravind Srinivasan,et al.  Multicommodity flow and circuit switching , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[13]  Alan M. Frieze.  Disjoint Paths in Expander Graphs via Random Walks: A Short Survey , 1998, RANDOM.

[14]  Eli Upfal,et al.  Static and dynamic path selection on expander graphs: a random walk approach , 1999 .

[15]  Aravind Srinivasan,et al.  New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.

[16]  Alan M. Frieze,et al.  Optimal construction of edge-disjoint paths in random regular graphs , 2000, SODA '99.

[17]  M. Blonski.  Equilibrium Characterization in Large Anonymous Games , 2001 .

[18]  B. Roos.  Multinomial and Krawtchouk Approximations to the Generalized Multinomial Distribution , 2002 .

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

[20]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[21]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

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

[23]  Ehud Kalai.  Partially-Specified Large Games , 2005, WINE.

[24]  Daniel M. Kane,et al.  On the complexity of two-player win-lose games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

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

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

[28]  Panagiota N. Panagopoulou,et al.  Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games , 2006, WINE.

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

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

[31]  A. Barbour,et al.  Translated Poisson Approximation for Markov Chains , 2006, 0810.0599.

[32]  Amin Saberi,et al.  Approximating nash equilibria using small-support strategies , 2007, EC '07.

[33]  Adrian Röllin.  Translated Poisson approximation using exchangeable pair couplings. , 2007 .

[34]  Thorsten Theobald,et al.  Games of fixed rank: a hierarchy of bimatrix games , 2005, SODA '07.

[35]  Christos H. Papadimitriou,et al.  Computing Equilibria in Anonymous Games , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[36]  A. Chattopadhyay.  Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits , 2007, FOCS 2007.

[37]  Aranyak Mehta,et al.  Progress in approximate nash equilibria , 2007, EC '07.