Prediction with Five Experts and Geometric Stopping: A Probabilistic Construction and Analytic Verification
Not on the map. Why?
Abstract (arXiv)
We present a solution of the limiting five-expert prediction problem with geometric stopping, based on stochastic calculus and partial differential equations. If δ is the stopping probability, the minimax expected regret from tied initial scores is 45π2/(512√2δ)+o(δ-1/2) as δdownarrow0. The adversarial rank control selecting the best and third-best experts maximizes the limiting Hamiltonian at every state. Following the four-expert construction of Bayraktar, Ekren, and Zhang (2020), we represent the value correction as a discounted boundary-local-time expectation for a degenerate obliquely reflected Brownian motion. The hyperbolic systems governing its boundary traces are derived and solved explicitly. To verify the nonlinear Hamilton--Jacobi--Bellman equation, we combine equality directions, hyperbolic comparison principles, and averaging across controls. These arguments reduce the 48 regional control inequalities to lower-dimensional boundary problems, with the remaining signs established by explicit monotonicity arguments. We prove global C2 regularity across both regional interfaces and changes in rank ordering. We also show that the alternating COMB control attains the limiting Hamiltonian maximum exactly when the two highest scores coincide and the third- and fourth-highest scores coincide.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Sep 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 3.
3 papers.