2017
DOI: 10.3982/qe643
|View full text |Cite
|
Sign up to set email alerts
|

The endogenous grid method for discrete-continuous dynamic choice models with (or without) taste shocks

Abstract: We present a fast and accurate computational method for solving and estimating a class of dynamic programming models with discrete and continuous choice variables. The solution method we develop for structural estimation extends the endogenous grid-point method (EGM) to discrete-continuous (DC) problems. Discrete choices can lead to kinks in the value functions and discontinuities in the optimal policy rules, greatly complicating the solution of the model. We show how these problems are ameliorated in the pres… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
63
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 79 publications
(65 citation statements)
references
References 32 publications
2
63
0
Order By: Relevance
“…We handle the discrete-choice options in the recursive problem according to the approach suggested by Iskhakov et al (2017), keeping for simplicity the same notation for functions V (·) and v(·). More specifically, we consider the addition of a random com-ponent to the valuation of discrete-choice options, and assume that this component is distributed according to an extreme-value (type I) distribution so that V j (a j , h j , s j , η j ) = max…”
Section: The Recursive Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…We handle the discrete-choice options in the recursive problem according to the approach suggested by Iskhakov et al (2017), keeping for simplicity the same notation for functions V (·) and v(·). More specifically, we consider the addition of a random com-ponent to the valuation of discrete-choice options, and assume that this component is distributed according to an extreme-value (type I) distribution so that V j (a j , h j , s j , η j ) = max…”
Section: The Recursive Formulationmentioning
confidence: 99%
“…The standard deviation of taste shocks for the discrete choice, σ , is set to a small value that adds smoothness to the discrete-choice part of the problem but prevents us from adding too much noise to the decision problem. See Iskhakov et al (2017). Table 8 displays the country-specific pension parameters that we use as inputs when we calibrate the pay-as-you-go component of the pension systems based on the information available in OECD (2007).…”
Section: B Appendix On the Calibrationmentioning
confidence: 99%
“…Similar to Barillas and Fernández-Villaverde (2007), Hintermaier and Koeniger (2010), , Iskhakov, Jørgensen, Rust, and Schjerning (2017), and especially Fella (2014), the endogenous grid points method originally developed by Carroll (2006) can thus be nested inside a value function iteration algorithm, with a grid search for the optimal debt choice, speeding up the solution algorithm. 15 The full solution algorithm is presented in the Appendix.…”
Section: Solution Algorithmmentioning
confidence: 99%
“…We briefly describe in this appendix how we deal with this potential non-concavity. An alternative would be to follow the method in Iskhakov et al (2017).…”
Section: Solution Methodsmentioning
confidence: 99%