Theorem 7.6.3 — the bold strategy is optimal in an unfavorable game
ProvedMDPFinance.InfiniteHorizonApplications.theorem_7_6_3gambling-theorymarkov-decision-processoptimal-control
When the win probability is at most , betting everything needed to reach in the fewest possible steps (the bold strategy) is optimal: the game is unfavorable, so minimizing the number of bets — rather than grinding out a long sequence of small ones — maximizes the chance of reaching the target before ruin.
Moderation note. Optimality is now among all Markov policies (the draft's ranged over stationary rules only).
Preamble
import Mathlib import Definitions.Def_MDPFinance_InfiniteHorizonApplications_Casino open MeasureTheory ProbabilityTheory
Formal statement
namespace MDPFinance.InfiniteHorizonApplications
/-- Theorem 7.6.3 (Bäuerle–Rieder, p. 228, PDF 239). If `p \le 1/2`, the bold strategy is
optimal, i.e. it maximizes the probability that the player will reach `B` before going bankrupt. -/
theorem theorem_7_6_3 (Mk : CasinoMarket) (hp : Mk.p ≤ 1 / 2) :
∀ x, Mk.Jinfpi Mk.bold x = Mk.Jinf x := by sorry
end MDPFinance.InfiniteHorizonApplications
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 228, Theorem 7.6.3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.