CONTENTS

Solution: Gambler's Ruin for a Biased Random Walk

Part 1

Mn+1=ρSn+Xn+1=MnρXn+1M_{n+1} = \rho^{S_n + X_{n+1}} = M_n\cdot \rho^{X_{n+1}}. Since Xn+1X_{n+1} is independent of Fn\mathcal{F}_n:

E[Mn+1Fn]=MnE[ρXn+1]=Mn(pρ+qρ1)=Mn(pq/p+qp/q)=Mn(q+p)=Mn.\mathbb{E}[M_{n+1} \mid \mathcal{F}_n] = M_n\cdot\mathbb{E}[\rho^{X_{n+1}}] = M_n\cdot(p\rho + q\rho^{-1}) = M_n\cdot (p\cdot q/p + q\cdot p/q) = M_n\cdot(q + p) = M_n.

Part 2

On {nτ}\{n \le \tau\}, Sn[0,N]S_n \in [0, N], so Mn=ρSn[min(1,ρN),max(1,ρN)]M_n = \rho^{S_n} \in [\min(1, \rho^N), \max(1, \rho^N)]. Hence (Mnτ)(M_{n \wedge \tau}) is bounded — OST's condition (2) holds.

Part 3

Apply OST: E[Mτ]=M0=ρk\mathbb{E}[M_\tau] = M_0 = \rho^k. Now Sτ{0,N}S_\tau \in \{0, N\}, so:

E[Mτ]=P(Sτ=N)ρN+P(Sτ=0)ρ0=P(Sτ=N)ρN+(1P(Sτ=N)).\mathbb{E}[M_\tau] = \mathbb{P}(S_\tau = N)\cdot \rho^N + \mathbb{P}(S_\tau = 0)\cdot \rho^0 = \mathbb{P}(S_\tau = N)\rho^N + (1 - \mathbb{P}(S_\tau = N)).

Setting equal to ρk\rho^k and solving:

P(Sτ=N)=ρk1ρN1,P(Sτ=0)=1P(Sτ=N)=ρNρkρN1.\mathbb{P}(S_\tau = N) = \frac{\rho^k - 1}{\rho^N - 1}, \qquad \mathbb{P}(S_\tau = 0) = 1 - \mathbb{P}(S_\tau = N) = \frac{\rho^N - \rho^k}{\rho^N - 1}.

Part 4

For (p,k,N)=(0.49,50,100)(p, k, N) = (0.49, 50, 100): ρ=0.51/0.491.0408\rho = 0.51/0.49 \approx 1.0408.

P(Sτ=100)=1.04085011.040810016.56849.110.119.\mathbb{P}(S_\tau = 100) = \frac{1.0408^{50} - 1}{1.0408^{100} - 1} \approx \frac{6.568}{49.11} \approx 0.119.

For (p,k,N)=(0.45,50,100)(p, k, N) = (0.45, 50, 100): ρ=0.55/0.451.2222\rho = 0.55/0.45 \approx 1.2222.

P(Sτ=100)=1.22225011.2222100113,7801.8981087.3105.\mathbb{P}(S_\tau = 100) = \frac{1.2222^{50} - 1}{1.2222^{100} - 1} \approx \frac{13{,}780}{1.898\cdot 10^8} \approx 7.3\cdot 10^{-5}.
Interpretation. A 1% house edge (p=0.49p = 0.49) already drops success probability to 12%. A 5% house edge (p=0.45p = 0.45) brings it to essentially zero. Casino house edges of 1–5% ensure that the gambler's probability of reaching a goal is exponentially small in the size of the goal relative to the capital. This is why casinos are robustly profitable despite each individual game being nearly-fair; the ruin probability compounds over the number of rounds played.

Takeaways

  • Gambler's ruin is an OST computation. Find a martingale that takes distinct values at each boundary, apply OST, solve the two-equation system.
  • Tiny edges compound to huge ruin probabilities. A 1% house edge produces an exponentially-small probability of doubling your stake, and a 5% edge makes doubling essentially impossible.
  • The key step is finding the right exponential martingale. ρSn\rho^{S_n} works only because the specific value ρ=q/p\rho = q/p makes E[ρX]=1\mathbb{E}[\rho^{X}] = 1, cancelling the bias.
  • Gambler's-ruin is isomorphic to knockout-option pricing. The probability of "hitting the upper barrier" is exactly the undiscounted price of a digital knock-in option — the barrier-option machinery is gambler's ruin with discounting.
Solution — Gambler's Ruin for a Biased Random Walk | q4quant.studio