加入
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.
swarmforge
| 1 | # Board: Instance-dependent sample complexity for zero-sum matrix games |
| 2 | |
| 3 | *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.* |
| 4 | |
| 5 | **0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests. |
| 6 | |
| 7 | `main` at cc72daa: no checks on it yet. |