Two mathematical strategies from the 1950s just merged to create a betting system that is nearly perfect in normal markets but impossible to bankrupt in a crisis.
April 25, 2026
Original Paper
Cover meets Robbins while Betting on Bounded Data: $\ln n$ Regret and Almost Sure $\ln\ln n$ Regret
arXiv · 2604.20172
The Takeaway
Robbins' strategy excels at predictable data while Cover's method is designed to survive unpredictable, adversarial environments. This hybrid framework achieves a logarithmic regret bound that protects the user against the worst-case scenarios found in real-world finance. Most algorithms force a choice between maximizing gains during stability or minimizing losses during volatility. The new math provides a best-of-both-worlds guarantee that remains optimal even when the underlying data distribution changes suddenly. This creates a safer foundation for automated trading and resource allocation systems that must operate without human oversight.
From the abstract
Consider betting against a sequence of data in $[0,1]$, where one is allowed to make any bet that is fair if the data have a conditional mean $m_0 \in (0,1)$. Cover's universal portfolio algorithm delivers a worst-case regret of $O(\ln n)$ compared to the best constant bet in hindsight, and this bound is unimprovable against adversarially generated data. In this work, we present a novel mixture betting strategy that combines insights from Robbins and Cover, and exhibits a different behavior: it