V_n, the guaranteed payoff in the n-round noisy min-max tree game, is tight for d=2, converges in distribution for d>=3, and converges almost surely for d>=15.
arXiv preprint arXiv:2409.02660 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A noisy min-max game on trees
V_n, the guaranteed payoff in the n-round noisy min-max tree game, is tight for d=2, converges in distribution for d>=3, and converges almost surely for d>=15.