Fetching the paper…
Reading the bibliography…
We study the computation of equilibria of anonymous games, via algorithms that may proceed via a sequence of adaptive queries to the game's payoff function, assumed to be unknown initially.
On the deterministic complexity of searching local maxima
I. Althöfer and K. Klaus-Uwe · 1993
Earlier work this paper cites.
Playing large games using simple strategies
R. J. Lipton, E. Markakis, and A. Mehta · 2003
Earlier work this paper cites.
Computing equilibria in anonymous games
C. Daskalakis and C. H. Papadimitriou · 2007
Earlier work this paper cites.
An efficient PTAS for two-strategy anonymous games
C. Daskalakis · 2008
Earlier work this paper cites.
Discretized multinomial distributions and Nash equilibria in anonymous games
C. Daskalakis and C. H. Papadimitriou · 2008
Earlier work this paper cites.
Symmetries and the complexity of pure Nash equilibrium
F. Brandt, F. Fischer, and M. Holzer · 2009
Earlier work this paper cites.
Settling the complexity of computing two-player Nash equilibria
X. Chen, X. Deng, and S. Teng · 2009
Earlier work this paper cites.
The complexity of computing a Nash equilibrium
C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou · 2009
Earlier work this paper cites.
On oblivious PTAS’s for Nash equilibrium
C. Daskalakis and C. H. Papadimitriou · 2009
Earlier work this paper cites.
Multiagent learning in large anonymous games
I. A. Kash, E. J. Friedman, and J. Y. Halpern · 2009
Cited alongside, same era.
Tight bounds for randomized and quantum local search
Shengyu Zhang · 2009
Cited alongside, same era.
On the complexity of Nash Equilibria and Other Fixed Points
K. Etessami and M. Yannakakis · 2010
Cited alongside, same era.
Lipschitz games
Y. Azrieli and E. Shmaya · 2013
Cited alongside, same era.
Best-reply dynamics in large binary-choice anonymous games
Y. Babichenko · 2013
Cited alongside, same era.
Sparse covers for sums of indicators
C. Daskalakis and C. H. Papadimitriou · 2013
Cited alongside, same era.
Finding approximate Nash equilibria of bimatrix games via payoff queries
J. Fearnley and R. Savani · 2014
Closest in time.
Bounds for the query complexity of approximate equilibria
P. W. Goldberg and A. Roth · 2014
Closest in time.
On the Complexity of Nash Equilibria in Anonymous Games
X. Chen, D. Durfee, and A. Orfanou · 2015
Closest in time.
Well-supported versus approximate nash equilibria: Query complexity of large games
Xi Chen, Yu Cheng, and Bo Tang · 2015
Closest in time.
Approximate Nash equilibria in anonymous games
C. Daskalakis and C. H. Papadimitriou · 2015
Closest in time.
A size-free CLT for poisson multinomials and its applications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The query complexity of correlated equilibria
S. Hart and N. Nisan · 2013
Cited alongside, same era.
On computing the distribution function for the Poisson binomial distribution
Y. Hong · 2013
Cited alongside, same era.
Query complexity of approximate Nash equilibria
Y. Babichenko · 2014
Cited alongside, same era.
Constantinos Daskalakis, Anindya De, and Christos Tzamos · 2015
Closest in time.
The fourier transform of poisson multinomial distributions and its algorithmic applications
Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart · 2015
Closest in time.
Learning equilibria of games via payoff queries
J. Fearnley, M. Gairing, P. W. Goldberg, and R. Savani · 2015
Closest in time.