TY - JOUR

T1 - A Generalization of the Classical Kelly Betting Formula to the Case of Temporal Correlation

AU - O'Brien, Joseph D.

AU - Burke, Kevin

AU - Burke, Mark E.

AU - Barmish, B. Ross

N1 - Publisher Copyright:
© 2017 IEEE.

PY - 2021/4

Y1 - 2021/4

N2 - For sequential betting games, Kelly's theory, aimed at maximization of the logarithmic growth of one's account value, involves optimization of the so-called betting fraction K. In this letter, we extend the classical formulation to allow for temporal correlation among bets. To demonstrate the potential of this new paradigm, for simplicity of exposition, we mainly address the case of a coin-flipping game with even-money payoff. To this end, we solve a problem with memory depth m. By this, we mean that the outcomes of coin flips are no longer assumed to be i.i.d. random variables. Instead, the probability of heads on flip k depends on previous flips k-1,k-2,..., k-m. For the simplest case of n flips, with m = 1 , we obtain a closed form solution Kn for the optimal betting fraction. This generalizes the classical result for the memoryless case. That is, instead of fraction K∗ = 2p-1 which pervades the literature for a coin with probability of heads p ≥ 1/2, our new fraction Kn depends on both n and the parameters associated with the temporal correlation. Generalizations of these results for m > 1 and numerical simulations are also included. Finally, we indicate how the theory extends to time-varying feedback and alternative payoff distributions.

AB - For sequential betting games, Kelly's theory, aimed at maximization of the logarithmic growth of one's account value, involves optimization of the so-called betting fraction K. In this letter, we extend the classical formulation to allow for temporal correlation among bets. To demonstrate the potential of this new paradigm, for simplicity of exposition, we mainly address the case of a coin-flipping game with even-money payoff. To this end, we solve a problem with memory depth m. By this, we mean that the outcomes of coin flips are no longer assumed to be i.i.d. random variables. Instead, the probability of heads on flip k depends on previous flips k-1,k-2,..., k-m. For the simplest case of n flips, with m = 1 , we obtain a closed form solution Kn for the optimal betting fraction. This generalizes the classical result for the memoryless case. That is, instead of fraction K∗ = 2p-1 which pervades the literature for a coin with probability of heads p ≥ 1/2, our new fraction Kn depends on both n and the parameters associated with the temporal correlation. Generalizations of these results for m > 1 and numerical simulations are also included. Finally, we indicate how the theory extends to time-varying feedback and alternative payoff distributions.

KW - control applications

KW - finance

KW - Markov processes

KW - Stochastic systems

UR - http://www.scopus.com/inward/record.url?scp=85089196580&partnerID=8YFLogxK

U2 - 10.1109/LCSYS.2020.3004029

DO - 10.1109/LCSYS.2020.3004029

M3 - Article

AN - SCOPUS:85089196580

SN - 2475-1456

VL - 5

SP - 623

EP - 628

JO - IEEE Control Systems Letters

JF - IEEE Control Systems Letters

IS - 2

M1 - 9122591

ER -