Lower bounds for the query complexity of equilibria in Lipschitz games.
Paul W. GoldbergMatthew J. KatzmanPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- query complexity
- lower bound
- nash equilibria
- concept class
- vc dimension
- game theoretic
- nash equilibrium
- game theory
- pure nash equilibria
- upper bound
- membership queries
- concept classes
- learning theory
- worst case
- repeated games
- incomplete information
- data complexity
- equivalence queries
- concept learning
- dnf formulas
- exact learning
- sample complexity
- np hard
- pac learning
- upper and lower bounds
- uniform distribution
- expressive power
- optimal solution
- lower and upper bounds
- decision problems
- objective function
- databases
- target concept
- compression scheme
- inductive logic programming
- resource allocation