-
-
Notifications
You must be signed in to change notification settings - Fork 2.3k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
DiscreteDP: Allow beta=1 #244
Conversation
This PR is ready for review. |
I looked through all of the changes to the files and everything seems in order. Give me another few days to play with it and look at it a bit more carefully, but this looks very good. Thanks for writing this code. |
Thanks @cc7768. I added in PR QuantEcon/QuantEcon.notebooks#37 an example of a finite-horizon problem with no discounting from Miranda-Fackler Section 7.6.6. |
This looks good and seems to have good testing for backward induction. One thought and then I will add a couple of line comments in the code.
|
vs[T] = v_T | ||
|
||
for t in range(T, 0, -1): | ||
ddp.bellman_operator(vs[t], Tv=vs[t-1], sigma=sigmas[t-1]) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
If we're voting I'd go with vs[t, :]
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yes, it's better to be explicit. I will rewrite it.
@cc7768 Thanks for your comments.
|
One (minor) issue is whether
|
Unless anybody has a strict preference for |
That sounds good to me. |
just to be explicit
Ready for merge. (I don't know how to do "github's new squash". Please do it.) |
The |
This will close #242.
TODO
backward_induction
for finite horizon problems