Expected value in recursive random variables
Working through some probability problems from Introduction to Probability, Blitzstein:
Kelly makes a series of n bets, each of which she has probability p of winning, independently. Initially, she has x0 dollars. Let Xj be the amount she has immediately after her jth bet is settled. Let f be a constant in (0, 1), called the betting fraction. On each bet, Kelly wagers a fraction f of her wealth, and then she either wins or loses that amount. For example, if her current wealth is 100 dollars and f = 0.25, then she bets 25 dollars and either gains or loses that amount. (A famous choice when p > 1/2 is f = 2p − 1, which is known as the Kelly criterion.) Find E($X_n$) (in terms of n, p, f, x0).
Hint: First find $E(X_{j+1}|X_j)$.
How can I use the hint? I found $E(X_1|X_0) = x_0(2pf-f+1)$, by plugging in the probability of winning (p) * winnings ($x_0+fx_0$) plus the probability of losing (1-p) * new winnings ($x_0-fx_0$)
But I do not know how to turn this into a recursive formula; any hints on the hint?
conditional-expectation recursion
asked Nov 30 '18 at 19:29
user603569user603569
728
add a comment |
Working through some probability problems from Introduction to Probability, Blitzstein:
Kelly makes a series of n bets, each of which she has probability p of winning, independently. Initially, she has x0 dollars. Let Xj be the amount she has immediately after her jth bet is settled. Let f be a constant in (0, 1), called the betting fraction. On each bet, Kelly wagers a fraction f of her wealth, and then she either wins or loses that amount. For example, if her current wealth is 100 dollars and f = 0.25, then she bets 25 dollars and either gains or loses that amount. (A famous choice when p > 1/2 is f = 2p − 1, which is known as the Kelly criterion.) Find E($X_n$) (in terms of n, p, f, x0).
Hint: First find $E(X_{j+1}|X_j)$.
How can I use the hint? I found $E(X_1|X_0) = x_0(2pf-f+1)$, by plugging in the probability of winning (p) * winnings ($x_0+fx_0$) plus the probability of losing (1-p) * new winnings ($x_0-fx_0$)
But I do not know how to turn this into a recursive formula; any hints on the hint?
conditional-expectation recursion
asked Nov 30 '18 at 19:29
user603569user603569
728
add a comment |
Working through some probability problems from Introduction to Probability, Blitzstein:
Kelly makes a series of n bets, each of which she has probability p of winning, independently. Initially, she has x0 dollars. Let Xj be the amount she has immediately after her jth bet is settled. Let f be a constant in (0, 1), called the betting fraction. On each bet, Kelly wagers a fraction f of her wealth, and then she either wins or loses that amount. For example, if her current wealth is 100 dollars and f = 0.25, then she bets 25 dollars and either gains or loses that amount. (A famous choice when p > 1/2 is f = 2p − 1, which is known as the Kelly criterion.) Find E($X_n$) (in terms of n, p, f, x0).
Hint: First find $E(X_{j+1}|X_j)$.
How can I use the hint? I found $E(X_1|X_0) = x_0(2pf-f+1)$, by plugging in the probability of winning (p) * winnings ($x_0+fx_0$) plus the probability of losing (1-p) * new winnings ($x_0-fx_0$)
But I do not know how to turn this into a recursive formula; any hints on the hint?
conditional-expectation recursion
asked Nov 30 '18 at 19:29
user603569user603569
728
Working through some probability problems from Introduction to Probability, Blitzstein:
Kelly makes a series of n bets, each of which she has probability p of winning, independently. Initially, she has x0 dollars. Let Xj be the amount she has immediately after her jth bet is settled. Let f be a constant in (0, 1), called the betting fraction. On each bet, Kelly wagers a fraction f of her wealth, and then she either wins or loses that amount. For example, if her current wealth is 100 dollars and f = 0.25, then she bets 25 dollars and either gains or loses that amount. (A famous choice when p > 1/2 is f = 2p − 1, which is known as the Kelly criterion.) Find E($X_n$) (in terms of n, p, f, x0).
Hint: First find $E(X_{j+1}|X_j)$.
How can I use the hint? I found $E(X_1|X_0) = x_0(2pf-f+1)$, by plugging in the probability of winning (p) * winnings ($x_0+fx_0$) plus the probability of losing (1-p) * new winnings ($x_0-fx_0$)
But I do not know how to turn this into a recursive formula; any hints on the hint?
conditional-expectation recursion
conditional-expectation recursion
asked Nov 30 '18 at 19:29
user603569user603569
728
asked Nov 30 '18 at 19:29
user603569user603569
728
asked Nov 30 '18 at 19:29
user603569user603569
728
asked Nov 30 '18 at 19:29
user603569user603569
728
asked Nov 30 '18 at 19:29
user603569user603569
728
728
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$E(X_{j+1}|X_j)$ = $X_j * p * (1+f) + X_j * ( 1 - p) * (1-f)$
$E(X_{j+1}|X_j)$ = $X_j *[2pf−f+1]$
now given that we can recursively write
$E(X_{j+1}|X_j, X_{j-1})$ = $X_j *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1] *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1]^2$
If we keep doing it we will get:
$E(X_n)$ = $X_0 * [2pf−f+1] ^ n$
The Kelly Criterion mentioned in the question maximizes the logarithm of this expected value.
Hope it helps
answered Nov 30 '18 at 19:51
OfyaOfya
5048
Yes it does - I got stuck on subscripts for my random variables, but also have a hard time conceptualizing recursive formulas. This makes sense though. Thanks @ofya
– user603569
Nov 30 '18 at 20:04
You're welcome, don't forget to like and mark the answer :))
– Ofya
Nov 30 '18 at 20:10
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020536%2fexpected-value-in-recursive-random-variables%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$E(X_{j+1}|X_j)$ = $X_j * p * (1+f) + X_j * ( 1 - p) * (1-f)$
$E(X_{j+1}|X_j)$ = $X_j *[2pf−f+1]$
now given that we can recursively write
$E(X_{j+1}|X_j, X_{j-1})$ = $X_j *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1] *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1]^2$
If we keep doing it we will get:
$E(X_n)$ = $X_0 * [2pf−f+1] ^ n$
The Kelly Criterion mentioned in the question maximizes the logarithm of this expected value.
Hope it helps
answered Nov 30 '18 at 19:51
OfyaOfya
5048
Yes it does - I got stuck on subscripts for my random variables, but also have a hard time conceptualizing recursive formulas. This makes sense though. Thanks @ofya
– user603569
Nov 30 '18 at 20:04
You're welcome, don't forget to like and mark the answer :))
– Ofya
Nov 30 '18 at 20:10
add a comment |
$E(X_{j+1}|X_j)$ = $X_j * p * (1+f) + X_j * ( 1 - p) * (1-f)$
$E(X_{j+1}|X_j)$ = $X_j *[2pf−f+1]$
now given that we can recursively write
$E(X_{j+1}|X_j, X_{j-1})$ = $X_j *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1] *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1]^2$
If we keep doing it we will get:
$E(X_n)$ = $X_0 * [2pf−f+1] ^ n$
The Kelly Criterion mentioned in the question maximizes the logarithm of this expected value.
Hope it helps
answered Nov 30 '18 at 19:51
OfyaOfya
5048
Yes it does - I got stuck on subscripts for my random variables, but also have a hard time conceptualizing recursive formulas. This makes sense though. Thanks @ofya
– user603569
Nov 30 '18 at 20:04
You're welcome, don't forget to like and mark the answer :))
– Ofya
Nov 30 '18 at 20:10
add a comment |
$E(X_{j+1}|X_j)$ = $X_j * p * (1+f) + X_j * ( 1 - p) * (1-f)$
$E(X_{j+1}|X_j)$ = $X_j *[2pf−f+1]$
now given that we can recursively write
$E(X_{j+1}|X_j, X_{j-1})$ = $X_j *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1] *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1]^2$
If we keep doing it we will get:
$E(X_n)$ = $X_0 * [2pf−f+1] ^ n$
The Kelly Criterion mentioned in the question maximizes the logarithm of this expected value.
Hope it helps
answered Nov 30 '18 at 19:51
OfyaOfya
5048
$E(X_{j+1}|X_j)$ = $X_j * p * (1+f) + X_j * ( 1 - p) * (1-f)$
$E(X_{j+1}|X_j)$ = $X_j *[2pf−f+1]$
now given that we can recursively write
$E(X_{j+1}|X_j, X_{j-1})$ = $X_j *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1] *[2pf−f+1]$
= $X_{j-1} *[2pf−f+1]^2$
If we keep doing it we will get:
$E(X_n)$ = $X_0 * [2pf−f+1] ^ n$
The Kelly Criterion mentioned in the question maximizes the logarithm of this expected value.
Hope it helps
answered Nov 30 '18 at 19:51
OfyaOfya
5048
answered Nov 30 '18 at 19:51
OfyaOfya
5048
answered Nov 30 '18 at 19:51
OfyaOfya
5048
answered Nov 30 '18 at 19:51
OfyaOfya
5048
5048
Yes it does - I got stuck on subscripts for my random variables, but also have a hard time conceptualizing recursive formulas. This makes sense though. Thanks @ofya
– user603569
Nov 30 '18 at 20:04
You're welcome, don't forget to like and mark the answer :))
– Ofya
Nov 30 '18 at 20:10
add a comment |
Yes it does - I got stuck on subscripts for my random variables, but also have a hard time conceptualizing recursive formulas. This makes sense though. Thanks @ofya
– user603569
Nov 30 '18 at 20:04
You're welcome, don't forget to like and mark the answer :))
– Ofya
Nov 30 '18 at 20:10
Yes it does - I got stuck on subscripts for my random variables, but also have a hard time conceptualizing recursive formulas. This makes sense though. Thanks @ofya
– user603569
Nov 30 '18 at 20:04
Yes it does - I got stuck on subscripts for my random variables, but also have a hard time conceptualizing recursive formulas. This makes sense though. Thanks @ofya
– user603569
Nov 30 '18 at 20:04
You're welcome, don't forget to like and mark the answer :))
– Ofya
Nov 30 '18 at 20:10
You're welcome, don't forget to like and mark the answer :))
– Ofya
Nov 30 '18 at 20:10
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020536%2fexpected-value-in-recursive-random-variables%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
