paper-with-me

홈 › Papers

The optimal betting wealth growth rate

2026-04-28 · Ashwin Ram, Aaditya Ramdas arxiv

This paper characterizes the best possible rate of growth of wealth in a Kelly betting game when repeatedly betting against a general i.i.d. null hypothesis $\mathscr{P}$, but the data are drawn i.i.d from an arbitrary alternative $Q$. We prove that it equals $\lim_{n \to \infty}n^{-1}\inf_{P \in (\mathscr P)^n)^{\circ\circ}} \mathrm{KL}(Q^n,P)$, where ${\mathscr P}^n = \{P^n: P \in \mathscr{P}\}$ and $(\mathscr {P}^n)^{\circ\circ}$ is its bipolar, i.e., this rate is achievable and one cannot do better. This quantity is in general smaller than a more popular quantity in the literature, $\mathrm{KL}_{\inf}(Q,\mathscr{P}) := \inf_{P \in \mathscr P}\mathrm{KL}(Q,P)$. If $\mathrm{KL}_{\mathrm{inf}}(\cdot,\mathscr P)$ is weakly lowersemicontinuous (w.l.s.c.) at $Q$, we show that the two quantities are equal; in particular, this happens when $\mathscr P$ is weakly compact. For simple alternatives, we provide the first matching necessary and sufficient condition for when power-one sequential tests exist (without assumptions on $\mathscr P, Q$). We also derive the optimal worst-case growth rate against composite $\mathscr Q$. We emphasize that test supermartingales on reduced filtrations suffice for all i.i.d. testing problems, and more general e-processes are not required. We thus completely generalize the recent results of Larsson et al.~\cite{larsson2025numeraire} to the sequential setting.

📄 PDF Abstract BibTeX arXiv:2604.25280

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Multi-Armed Sequential Hypothesis Testing by Betting

2026-03-18 · Ricardo J. Sandoval, Ian Waudby-Smith, Michael I. Jordan arxiv

We consider a variant of sequential testing by betting where, at each time step, the statistician is presented with multiple data sources (arms) and obtains data by choosing one of the arms. We consider the composite glo…

Sleeping Kelly

2025-09-26 · Ben Abramowitz arxiv

The Sleeping Beauty problem is a problem of imperfect recall that has received considerable attention. One approach to resolving the Sleeping Beauty problem has been to allow Sleeping Beauty to make decisions based on he…

From Betting to Empirical Bernstein LIL

2026-05-21 · Francesco Orabona arxiv

This is a verbatim copy of a technical report I wrote in 2017-2018 to obtain the law of the iterated logarithm using the guarantee on the wealth of an online betting strategy.

Asymptotically optimal strategies in a diffusion approximation of a repeated betting game

2021-08-26 · Mikhail Zhitlukhin

We construct a diffusion approximation of a repeated game in which agents make bets on outcomes of i.i.d. random vectors and their strategies are close to an asymptotically optimal strategy. This model can be interpreted…

Optimal Bookmaking

2019-07-01 · Matthew Lorig, Zhou Zhou, Bin Zou

We introduce a general framework for continuous-time betting markets, in which a bookmaker can dynamically control the prices of bets on outcomes of random events. In turn, the prices set by the bookmaker affect the rate…