2 problems

Let $\mathcal{S}=(\mathcal{I}_1,\mathcal{I}_2,\dots)$ be an infinite-length strategy, and define … Here $\operatorname{disc}(n)$ is the optimal discrepancy for finite strategies of…

For each positive integer $n$, let $\operatorname{disc}(n)$ be the minimum, over all strategies of length $n$ that repeatedly split an existing interval into two starting from…