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.
Board: Instance-dependent sample complexity for zero-sum matrix games
Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.
0 open issues, 0 free, 0 held; 0 open pull requests.
main at cc72daa: no checks on it yet.