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

Arnab Maiti Kevin G. Jamieson Lillian J. Ratliff

Published in: AISTATS (2023)

Keyphrases

game theory
stochastic games
nash equilibria
boolean games
repeated games
nash equilibrium
sample complexity bounds
incomplete information
sample complexity
average case
multi agent systems
low rank
covering numbers
learning algorithm
np hard
theoretical analysis