Fetching the paper…
Reading the bibliography…
We study the randomized query complexity of approximate Nash equilibria (ANE) in large games.
“Equilibrium points in N-Person Games”
J.F. Nash · 1950
Earlier work this paper cites.
“A Simple Adaptive Procedure Leading to Correlated Equilibrium”
S. Hart and A. Mas-Colell · 2000
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.
“The Nash Equilibrium: A Perspective”
C.A. Holt and A.E. Roth · 2004
Earlier work this paper cites.
“On the Complexity of Two-Player Win-Lose Games”
T. Abbott, D. Kane and P. Valiant · 2005
Earlier work this paper cites.
“Nash Equilibria in Random Games”
I. B“’ar“’any, S. Vempala and A. Vetta · 2005
Earlier work this paper cites.
“Adaptive Heuristics”
S. Hart · 2005
Earlier work this paper cites.
“From External to Internal Regret”
A. Blum and Y. Monsour · 2007
Earlier work this paper cites.
“Games of Fixed Rank: A Hierarchy of Bimatrix Games”
R. Kannan and T. Theobald · 2007
Earlier work this paper cites.
“An Optimization Approach for Approximate Nash Equilibria”
H. Tsaknakis and P.G. Spirakis · 2007
Earlier work this paper cites.
“Computing Correlated Equilibria in Multi-Player Games”
C.H. Papadimitriou and T. Roughgarden · 2008
Cited alongside, same era.
“Settling the Complexity of Computing Two-player Nash Equilibria”
X. Chen, X. Deng and S.-H. Teng · 2009
Cited alongside, same era.
“The Complexity of Computing a Nash Equilibrium”
C. Daskalakis, P.W. Goldberg and C.H. Papadimitriou · 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.
“Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games”
A.X. Jiang and K. Leyton-Brown · 2011
Cited alongside, same era.
“Learning Equilibria of Games via Payoff Queries”
J. Fearnley, M. Gairing, P. Goldberg and R. Savani · 2013
Cited alongside, same era.
“Constant Rank Bimatrix Games Are PPAD-hard”
R. Mehta · 2014
Later among the works it cites.
“Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory’s Theorem”
S. Barman · 2015
Closest in time.
“Query Complexity of Correlated Equilibrium”
Y. Babichenko and S. Barman · 2015
Closest in time.
“Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash”
Y. Babichenko, C.H. Papadimitriou and A. Rubinstein · 2015
Closest in time.
“On the Complexity of Nash Equilibria in Anonymous Games”
X. Chen, D. Durfee and A. Orfanou · 2015
Closest in time.
“Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables”
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.
“Query Complexity of Approximate Nash Equilibria”
Y. Babichenko · 2014
Cited alongside, same era.
“Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries”
J. Fearnley and R. Savani · 2014
Cited alongside, same era.
“Bounds for the Query Complexity of Approximate Equilibria”
P.W. Goldberg and A. Roth · 2014
Cited alongside, same era.
I. Diakonikolas, D.M. Kane and A. Stewart · 2015
Closest in time.
“On the Structure, Covering, and Learning of Poisson Multinomial Distributions”
C. Daskalakis, G. Kamath and C. Tzamos · 2015
Closest in time.
“Approximate Nash Equilibria in Anonymous Games”
C. Daskalakis and C.H. Papadimitriou · 2015
Closest in time.
“Query Complexity of Approximate Equilibria in Anonymous Games”
P.W. Goldberg and S. Turchetta · 2015
Closest in time.
“Inapproximability of Nash Equilibrium”
A. Rubinstein · 2015
Closest in time.