Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games.
Paul W. GoldbergMatthew J. KatzmanPublished in: SAGT (2021)
Keyphrases
- query complexity
- lower bound
- concept class
- nash equilibria
- vc dimension
- game theoretic
- nash equilibrium
- game theory
- pure nash equilibria
- upper bound
- learning theory
- membership queries
- concept classes
- data complexity
- equivalence queries
- incomplete information
- repeated games
- sample complexity
- worst case
- dnf formulas
- concept learning
- exact learning
- lower and upper bounds
- np hard
- uniform distribution
- pac learning
- statistical queries
- optimal solution
- objective function
- metric space
- efficient learning
- upper and lower bounds
- target concept
- sample size
- boolean functions
- database
- generalization error