The Kelly Criterion And Utility Function Optimisation For Stochastic Binary Games: Submartingale And Supermartingale Regimes
Abstract
A reformulation of the Kelly Criterion is presented. Let G be a generic stochastic Bernoulli binary game with outcomes Z(I)∈ -1,1 of N trials for I=1...N. The binomial probabilities are P(Z(I)=1)=p and P(Z(I)=-1)=q with p+q=1. For a fair game p=q=12 and for a biased game p>q. If W(0) is the initial wealth then at the Ith trial one bets a fraction F so that the bet is B(I)=FW(I-1). If one wagers B(I) and wins one recovers the original wager plus B(I) if Z(I)=+1, or a loss of B(I) if Z(I)=-1. The wealth at the Nth trial/bet for large N is the random walk W(N)=W (0)+ΣI=1NB(I)Z(I)=W(0)ΠI=1N(1+FZ(I)) with expectation E[W(N)]. Defining a 'utility function' U(F,p)=E[(W(N)/W(0))1/N] then U(F,p) is optimised by the Kelly fraction F=FK=p-q=2p-1, which is essentially a critical point of U(F,p). Also U(FK,p) can be related to the Shannon entropy. If [0,1]=[0,F*) [F*] (F*,1] with U(F*,p)=0 then U(F,p)>0, ∀F∈[0,F*) and W(N) is a submartingale for p>1/2; also U(F,p)<0,∀ F∈(F*,1], and W(F,p) is a supermartingale. Estimates are derived for variance and volatility VAR(W(N)) and σ(W(N))=VAR(W(N)). For large N and F=FK, E[W(N)] grows exponentially.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.