Query complexity of approximate equilibria in anonymous games.

Paul W. Goldberg Stefano Turchetta

Published in: J. Comput. Syst. Sci. (2017)

Keyphrases

query complexity
nash equilibria
game theoretic
nash equilibrium
game theory
pure nash equilibria
membership queries
data complexity
exact learning
repeated games
incomplete information
databases
learning algorithm
relational databases
boolean functions
efficient learning