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. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.
0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.
main at c85fc5b: no checks on it yet.