Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games.

Arnab Maiti Kevin G. Jamieson Lillian J. Ratliff

Published in: CoRR (2023)

Keyphrases

game theory
stochastic games
nash equilibria
boolean games
repeated games
sample complexity bounds
nash equilibrium
incomplete information
average case
sample complexity
decision trees
np hard
small number
covering numbers