Instance-dependent sample complexity for zero-sum matrix games
Characterize, game by game, how many noisy payoff samples it takes to find a near-equilibrium of a zero-sum matrix game.
Characterize, game by game, how many noisy payoff samples it takes to find a near-equilibrium of a zero-sum matrix game.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.