A game-theoretic reformulation of sequential detection shows the LIL as the minimax boundary, with the optimal mixing prior being the Jeffreys prior on the scale-of-scales selected by the Erdős-Kolmogorov test, yielding a 3/2 coefficient for the first iterated-log correction.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Establishes the exact LIL for the p-rotor walk on Z via martingale decomposition and calculus of variations on the perturbed Strassen set.
citing papers explorer
-
The multiply iterated law of the iterated logarithm: game-theoretic foundations of sequential detection boundaries
A game-theoretic reformulation of sequential detection shows the LIL as the minimax boundary, with the optimal mixing prior being the Jeffreys prior on the scale-of-scales selected by the Erdős-Kolmogorov test, yielding a 3/2 coefficient for the first iterated-log correction.