The optimal worst-case bookmaking loss for K outcomes and T rounds is the largest root of an explicit polynomial, with regret scaling as sqrt(T) times the largest Hermite root.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal Online Bookmaking for Any Number of Outcomes
The optimal worst-case bookmaking loss for K outcomes and T rounds is the largest root of an explicit polynomial, with regret scaling as sqrt(T) times the largest Hermite root.