stochastic dynamic programming - how to set up bellman and find FOCs
$begingroup$
I have a function:
$$ U = mathbb{E} bigg[ sum_{t=0}^{infty} beta^t ln c_t bigg]$$
Where $0<beta<1$ and my constraints are:
$$c_t + k_{t+1} = phi_t Ak_t^{alpha}, 0<alpha<1, k_1 = b_1 in mathbb{R}$$
where $phi_t$ is iid.
Then am I going about the correct way to find the FOCs?
Setting up the bellman we have:
$$ V_t(k_t) = max_{k_t}big{ln (phi_t AK_t^alpha -k_{t+1}) + beta V_{t+1}(k_{t+1}) big}$$
Am I on the right track?
stochastic-calculus dynamic-programming
$endgroup$
add a comment |
$begingroup$
I have a function:
$$ U = mathbb{E} bigg[ sum_{t=0}^{infty} beta^t ln c_t bigg]$$
Where $0<beta<1$ and my constraints are:
$$c_t + k_{t+1} = phi_t Ak_t^{alpha}, 0<alpha<1, k_1 = b_1 in mathbb{R}$$
where $phi_t$ is iid.
Then am I going about the correct way to find the FOCs?
Setting up the bellman we have:
$$ V_t(k_t) = max_{k_t}big{ln (phi_t AK_t^alpha -k_{t+1}) + beta V_{t+1}(k_{t+1}) big}$$
Am I on the right track?
stochastic-calculus dynamic-programming
$endgroup$
add a comment |
$begingroup$
I have a function:
$$ U = mathbb{E} bigg[ sum_{t=0}^{infty} beta^t ln c_t bigg]$$
Where $0<beta<1$ and my constraints are:
$$c_t + k_{t+1} = phi_t Ak_t^{alpha}, 0<alpha<1, k_1 = b_1 in mathbb{R}$$
where $phi_t$ is iid.
Then am I going about the correct way to find the FOCs?
Setting up the bellman we have:
$$ V_t(k_t) = max_{k_t}big{ln (phi_t AK_t^alpha -k_{t+1}) + beta V_{t+1}(k_{t+1}) big}$$
Am I on the right track?
stochastic-calculus dynamic-programming
$endgroup$
I have a function:
$$ U = mathbb{E} bigg[ sum_{t=0}^{infty} beta^t ln c_t bigg]$$
Where $0<beta<1$ and my constraints are:
$$c_t + k_{t+1} = phi_t Ak_t^{alpha}, 0<alpha<1, k_1 = b_1 in mathbb{R}$$
where $phi_t$ is iid.
Then am I going about the correct way to find the FOCs?
Setting up the bellman we have:
$$ V_t(k_t) = max_{k_t}big{ln (phi_t AK_t^alpha -k_{t+1}) + beta V_{t+1}(k_{t+1}) big}$$
Am I on the right track?
stochastic-calculus dynamic-programming
stochastic-calculus dynamic-programming
asked Dec 4 '18 at 23:38
elbartoelbarto
1,550824
1,550824
add a comment |
add a comment |
0
active
oldest
votes
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%2f3026353%2fstochastic-dynamic-programming-how-to-set-up-bellman-and-find-focs%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
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%2f3026353%2fstochastic-dynamic-programming-how-to-set-up-bellman-and-find-focs%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