Obtaining analytic derivatives for a popular discrete-choice dynamic programming model
We show how to recursively calculate analytic first and second derivatives of the likelihood for a popular discrete-choice, dynamic programming model. These allow for decreased computing time, and are useful for de-bugging complicated program code and accurately estimating standard errors.
Year of publication: |
2008
|
---|---|
Authors: | Eberwein, Curtis ; Ham, John C. |
Published in: |
Economics Letters. - Elsevier, ISSN 0165-1765. - Vol. 101.2008, 3, p. 168-171
|
Publisher: |
Elsevier |
Keywords: | Derivatives Dynamic programming Structural estimation Computation Standard errors |
Saved in:
Saved in favorites
Similar items by person
-
Alternative methods of estimating program effects in event history models
Eberwein, Curtis, (2002)
-
Eberwein, Curtis J., (1997)
-
Obtaining analytic derivatives for a popular discrete-choice dynamic programming model
Eberwein, Curtis, (2008)
- More ...