$\varepsilon$-Good Action Identification in Fixed-Budget Monte Carlo Tree Search
arXiv:2605.11324v1 Announce Type: cross
Abstract: We study the fixed-budget max-min action identification problem in depth-2 max-min trees, an important special case of Monte Carlo Tree Search. A learner sequentially allocates $T$ samples to leaves an…