In probability theory and intertemporal portfolio choice, the **Kelly criterion**, **Kelly strategy**, **Kelly formula**, or **Kelly bet**, is a formula used to determine the optimal size of a series of bets. In most gambling scenarios, and some investing scenarios under some simplifying assumptions, the Kelly strategy will do better than any essentially different strategy in the long run (that is, over a span of time in which the observed fraction of bets that are successful equals the probability that any given bet will be successful). It was described by J. L. Kelly, Jr, a researcher at Bell Labs, in 1956. The practical use of the formula has been demonstrated.

The Kelly Criterion is to bet a predetermined fraction of assets and can be counterintuitive. In one study, each participant was given $25 and asked to bet on a coin that would land heads 60% of the time. The prizes were capped at $250. "Remarkably, 28% of the participants went bust, and the average payout was just $91. Only 21% of the participants reached the maximum. 18 of the 61 participants bet everything on one toss, while two-thirds gambled on tails at some stage in the experiment. Neither approach is in the least bit optimal." Using the Kelly criterion and based on the odds in the experiment, the right approach would be to bet 20% of the pot on each throw (see first example in **Statement** below). If losing, the size of the bet gets cut; if winning, the stake increases.

Although the Kelly strategy's promise of doing better than any other strategy in the long run seems compelling, some economists have argued strenuously against it, mainly because an individual's specific investing constraints may override the desire for optimal growth rate. The conventional alternative is expected utility theory which says bets should be sized to maximize the expected utility of the outcome (to an individual with logarithmic utility, the Kelly bet maximizes expected utility, so there is no conflict; moreover, Kelly's original paper clearly states the need for a utility function in the case of gambling games which are played finitely many times). Even Kelly supporters usually argue for fractional Kelly (betting a fixed fraction of the amount recommended by Kelly) for a variety of practical reasons, such as wishing to reduce volatility, or protecting against non-deterministic errors in their advantage (edge) calculations.

In recent years, Kelly has become a part of mainstream investment theory and the claim has been made that well-known successful investors including Warren Buffett and Bill Gross use Kelly methods. William Poundstone wrote an extensive popular account of the history of Kelly betting.

For simple bets with two outcomes, one involving losing the entire amount bet, and the other involving winning the bet amount multiplied by the payoff odds, the Kelly bet is:

f
∗
=
b
p
−
q
b
=
p
(
b
+
1
)
−
1
b
,
where:

*f** is the fraction of the current bankroll to wager, i.e. how much to bet;
*b* is the net odds received on the wager ("*b* to 1"); that is, you could win $b (on top of getting back your $1 wagered) for a $1 bet
*p* is the probability of winning;
*q* is the probability of losing, which is 1 − *p*.

As an example, if a gamble has a 60% chance of winning (*p* = 0.60, *q* = 0.40), and the gambler receives 1-to-1 odds on a winning bet (*b* = 1), then the gambler should bet 20% of his bankroll at each opportunity (*f** = 0.20), in order to maximize the long-run growth rate of the bankroll.

If the gambler has zero edge, i.e. if *b* = *q* / *p*, then the criterion recommends the gambler bets nothing.

If the edge is negative (*b* < *q* / *p*) the formula gives a negative result, indicating that the gambler should take the other side of the bet. For example, in standard American roulette, the bettor is offered an even money payoff (b = 1) on red, when there are 18 red numbers and 20 non-red numbers on the wheel (p = 18/38). The Kelly bet is -1/19, meaning the gambler should bet one-nineteenth of his bankroll that red will *not* come up. Unfortunately, the casino doesn't allow betting *against* something coming up, so a Kelly gambler cannot place a bet.

The top of the first fraction is the expected net winnings from a $1 bet, since the two outcomes are that you either win $*b* with probability *p*, or lose the $1 wagered, i.e. win $-1, with probability *q*. Hence:

f
∗
=
expected net winnings
net winnings if you win
For even-money bets (i.e. when *b* = 1), the first formula can be simplified to:

f
∗
=
p
−
q
.
Since q = 1-p, this simplifies further to

f
∗
=
2
p
−
1.
A more general problem relevant for investment decisions is the following:

1. The probability of success is
p
.

2. If you succeed, the value of your investment increases from
1
to
1
+
b
.

3. If you fail (for which the probability is
q
=
1
−
p
) the value of your investment decreases from
1
to
1
−
a
. (Note that the previous description above assumes that *a* is 1).

In this case, the Kelly criterion turns out to be the relatively simple expression

f
∗
=
p
/
a
−
q
/
b
.
Note that this reduces to the original expression for the special case above (
f
∗
=
p
−
q
) for
b
=
a
=
1
.

Clearly, in order to decide in favor of investing at least a small amount
(
f
∗
>
0
)
, you must have

p
b
>
q
a
.
which obviously is nothing more than the fact that your expected profit must exceed the expected loss for the investment to make any sense.

The general result clarifies why leveraging (taking a loan to invest) decreases the optimal fraction to be invested, as in that case
a
>
1
. Obviously, no matter how large the probability of success,
p
, is, if
a
is sufficiently large, the optimal fraction to invest is zero. Thus, using too much margin is not a good investment strategy, no matter how good an investor you are.

Heuristic proofs of the Kelly criterion are straightforward. For a symbolic verification with Python and SymPy one would set the derivative y'(x) of the expected value of the logarithmic bankroll y(x) to 0 and solve for *x*:

For a rigorous and general proof, see Kelly's original paper or some of the other references listed below. Some corrections have been published.

We give the following non-rigorous argument for the case b = 1 (a 50:50 "even money" bet) to show the general idea and provide some insights.

When *b* = 1, the Kelly bettor bets 2*p* - 1 times initial wealth, *W*, as shown above. If he wins, he has 2*pW*. If he loses, he has 2(1 - *p*)*W*. Suppose he makes *N* bets like this, and wins *K* of them. The order of the wins and losses doesn't matter, he will have:

2
N
p
K
(
1
−
p
)
N
−
K
W
.
Suppose another bettor bets a different amount, (2*p* - 1 +
Δ
)W for some positive or negative
Δ
. He will have (2p +
Δ
)*W* after a win and [2(1 - *p*)-
Δ
]*W* after a loss. After the same wins and losses as the Kelly bettor, he will have:

(
2
p
+
Δ
)
K
[
2
(
1
−
p
)
−
Δ
]
N
−
K
W
Take the derivative of this with respect to
Δ
and get:

K
(
2
p
+
Δ
)
K
−
1
[
2
(
1
−
p
)
−
Δ
]
N
−
K
W
−
(
N
−
K
)
(
2
p
+
Δ
)
K
[
2
(
1
−
p
)
−
Δ
]
N
−
K
−
1
W

The turning point of the original function occurs when this derivative equals zero, which occurs at:

K
[
2
(
1
−
p
)
−
Δ
]
=
(
N
−
K
)
(
2
p
+
Δ
)
which implies:

Δ
=
2
(
K
N
−
p
)
but:

lim
N
→
+
∞
K
N
=
p
so in the long run, final wealth is maximized by setting
Δ
to zero, which means following the Kelly strategy.

This illustrates that Kelly has both a deterministic and a stochastic component. If one knows K and N and wishes to pick a constant fraction of wealth to bet each time (otherwise one could cheat and, for example, bet zero after the K^{th} win knowing that the rest of the bets will lose), one will end up with the most money if one bets:

(
2
K
N
−
1
)
W
each time. This is true whether *N* is small or large. The "long run" part of Kelly is necessary because K is not known in advance, just that as *N* gets large, *K* will approach *pN*. Someone who bets more than Kelly can do better if *K* > *pN* for a stretch; someone who bets less than Kelly can do better if *K* < *pN* for a stretch, but in the long run, Kelly always wins.

The heuristic proof for the general case proceeds as follows.

In a single trial, if you invest the fraction
f
of your capital, if your strategy succeeds, your capital at the end of the trial increases by the factor
1
−
f
+
f
(
1
+
b
)
=
1
+
f
b
, and, likewise, if the strategy fails, you end up having your capital decreased by the factor
1
−
f
a
. Thus at the end of
N
trials (with
p
N
successes and
q
N
failures ), the starting capital of $1 yields

C
N
=
(
1
+
f
b
)
p
N
(
1
−
f
a
)
q
N
.
Maximizing
log
(
C
N
)
/
N
, and consequently
C
N
, with respect to
f
leads to the desired result

f
∗
=
p
/
a
−
q
/
b
.
For a more detailed discussion of this formula for the general case, see. There, it can be seen that the substitution of
p
for the ratio of the number of "successes" to the number of trials implies that the number of trials must be very large, since
p
is defined as the limit of this ratio as the number of trials goes to infinity. In brief, betting
f
∗
each time will likely maximize the wealth growth rate only in the case where the number of trials is very large, and
p
and
b
are the same for each trial. In practice, this is a matter of playing the same game over and over, where the probability of winning and the payoff odds are always the same. In the heuristic proof above,
p
N
successes and
q
N
failures are highly likely only for very large
N
.

In a 1738 article, Daniel Bernoulli suggested that, when one has a choice of bets or investments, one should choose that with the highest geometric mean of outcomes. This is mathematically equivalent to the Kelly criterion, although the motivation is entirely different (Bernoulli wanted to resolve the St. Petersburg paradox).

The Bernoulli article was not translated into English until 1954, but the work was well-known among mathematicians and economists.

Kelly's criterion may be generalized on gambling on many mutually exclusive outcomes, like in horse races. Suppose there are several mutually exclusive outcomes. The probability that the k-th horse wins the race is
p
k
, the total amount of bets placed on k-th horse is
B
k
, and

β
k
=
B
k
∑
i
B
i
=
1
1
+
Q
k
,
where
Q
k
are the pay-off odds.
D
=
1
−
t
t
, is the dividend rate where
t
t
is the track take or tax,
D
β
k
is the revenue rate after deduction of the track take when k-th horse wins. The fraction of the bettor's funds to bet on k-th horse is
f
k
. Kelly's criterion for gambling with multiple mutually exclusive outcomes gives an algorithm for finding the optimal set
S
o
of outcomes on which it is reasonable to bet and it gives explicit formula for finding the optimal fractions
f
k
o
of bettor's wealth to be bet on the outcomes included in the optimal set
S
o
. The algorithm for the optimal set of outcomes consists of four steps.

Step 1 Calculate the expected revenue rate for all possible (or only for several of the most promising) outcomes:
e
r
k
=
D
β
k
p
k
=
D
(
1
+
Q
k
)
p
k
.

Step 2 Reorder the outcomes so that the new sequence
e
r
k
is non-increasing. Thus
e
r
1
will be the best bet.

Step 3 Set
S
=
∅
(the empty set),
k
=
1
,
R
(
S
)
=
1
. Thus the best bet
e
r
k
=
e
r
1
will be considered first.

Step 4 Repeat:

If
e
r
k
=
D
β
k
p
k
>
R
(
S
)
then insert k-th outcome into the set:
S
=
S
∪
{
k
}
, recalculate
R
(
S
)
according to the formula:
R
(
S
)
=
1
−
∑
i
∈
S
p
i
1
−
∑
i
∈
S
β
i
D
and then set
k
=
k
+
1
,

Else set
S
o
=
S
and then stop the repetition.

If the optimal set
S
o
is empty then do not bet at all. If the set
S
o
of optimal outcomes is not empty then the optimal fraction
f
k
o
to bet on k-th outcome may be calculated from this formula:
f
k
o
=
e
r
k
−
R
(
S
o
)
D
β
k
=
p
k
−
R
(
S
o
)
D
β
k
.

One may prove that

R
(
S
o
)
=
1
−
∑
i
∈
S
o
f
i
o
where the right hand-side is the reserve rate. Therefore the requirement
e
r
k
=
D
β
k
p
k
>
R
(
S
)
may be interpreted as follows: k-th outcome is included in the set
S
o
of optimal outcomes if and only if its expected revenue rate is greater than the reserve rate. The formula for the optimal fraction
f
k
o
may be interpreted as the excess of the expected revenue rate of k-th horse over the reserve rate divided by the revenue after deduction of the track take when k-th horse wins or as the excess of the probability of k-th horse winning over the reserve rate divided by revenue after deduction of the track take when k-th horse wins. The binary growth exponent is

G
o
=
∑
i
∈
S
p
i
log
2
(
e
r
i
)
+
(
1
−
∑
i
∈
S
p
i
)
log
2
(
R
(
S
o
)
)
,
and the doubling time is

T
d
=
1
G
o
.
This method of selection of optimal bets may be applied also when probabilities
p
k
are known only for several most promising outcomes, while the remaining outcomes have no chance to win. In this case it must be that
∑
i
p
i
<
1
and
∑
i
β
i
<
1
.

Considering a single asset (Stock, index etc.) and a risk-free rate, it is easy to obtain the optimal fraction to invest through the Geometric Brownian Motion. Taking the value of asset
S
at time
t
(
S
t
):

E
log
(
S
t
)
=
log
(
S
0
)
+
(
μ
−
σ
2
2
)
t

Then the expected log return
R
s
is

R
s
=
(
μ
−
σ
2
2
)
t

For a portfolio made of an asset
S
and a bond paying risk-free rate
r
. With a fraction
f
invested in
S
and
(
1
−
f
)
in the bond. The Expected rate of return
G
(
f
)
is given by:

G
(
f
)
=
f
μ
−
(
f
σ
)
2
2
+
(
(
1
−
f
)
r
)

Solving
max
(
G
(
f
)
)
we obtain:

f
∗
=
μ
−
r
σ
2

Being
f
∗
the fraction that maximizes the return, and so, the Kelly fraction.

Thorp arrived at the same result but through a different deduction / derivation.

Remember that
μ
is different from the asset log return
R
s
. Confusing this is a common mistake made by websites and articles talking about the Kelly Criterion.

Consider a market with
n
correlated stocks
S
k
with stochastic returns
r
k
,
k
=
1
,
.
.
.
,
n
and a riskless bond with return
r
. An investor puts a fraction
u
k
of his capital in
S
k
and the rest is invested in bond. Without loss of generality, assume that investor's starting capital is equal to 1. According to Kelly criterion one should maximize
E
[
ln
(
(
1
+
r
)
+
∑
k
=
1
n
u
k
(
r
k
−
r
)
)
]

Expanding it to the Taylor series around
u
0
→
=
(
0
,
…
,
0
)
we obtain

E
[
ln
(
1
+
r
)
+
∑
k
=
1
n
u
k
(
r
k
−
r
)
1
+
r
−
1
2
∑
k
=
1
n
∑
j
=
1
n
u
k
u
j
(
r
k
−
r
)
(
r
j
−
r
)
(
1
+
r
)
2
]

Thus we reduce the optimization problem to quadratic programming and the unconstrained solution is
u
⋆
→
=
(
1
+
r
)
(
Σ
^
)
−
1
(
r
→
^
−
r
)

where
r
→
^
and
Σ
^
are the vector of means and the matrix of second mixed noncentral moments of the excess returns. There are also numerical algorithms for the fractional Kelly strategies and for the optimal solution under no leverage and no short selling constraints.