The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2010
DOI: 10.1016/j.jedc.2008.11.009
|View full text |Cite
|
Sign up to set email alerts
|

Solving the incomplete markets model with aggregate uncertainty by backward induction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
48
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(48 citation statements)
references
References 6 publications
(4 reference statements)
0
48
0
Order By: Relevance
“…Those are the backward induction procedure, referred to as BInduc throughout this paper, developed in Reiter (2009b), the parameterized distribution procedure, referred to as Param, of Algan et al (2009), and the explicit aggregation algorithm, referred to as Xpa, developed in den Haan and Rendahl (2009). These algorithms are summarized in the subsections on projection methods.…”
mentioning
confidence: 99%
“…Those are the backward induction procedure, referred to as BInduc throughout this paper, developed in Reiter (2009b), the parameterized distribution procedure, referred to as Param, of Algan et al (2009), and the explicit aggregation algorithm, referred to as Xpa, developed in den Haan and Rendahl (2009). These algorithms are summarized in the subsections on projection methods.…”
mentioning
confidence: 99%
“…The algorithm iterates on this procedure until the information provided by the simulation is consistent with the assumptions made about the shape of the cross-sectional distribution. The philosophy that underlies our algorithm is similar to the one in Reiter (2009). The differences are mainly in terms of implementation, which is less cumbersome for our algorithm.…”
Section: Article In Pressmentioning
confidence: 99%
“…First, it illustrates the simplicity of our algorithm and brings to light the advantages relative to alternative algorithms. Second, we want to make clear why our algorithm can solve models with heterogeneous agents without generating a complete cross-sectional distribution by simulating a panel as is done by Krusell and Smith (1998) and without parameterizing the distribution as is done by Algan et al (2008Algan et al ( , 2009) and Reiter (2009).…”
Section: Solving the Model Without Aggregate Uncertaintymentioning
confidence: 99%
“…The individual policy rules describe optimal behavior conditional on the aggregate laws of motions and the aggregate laws of motion provide a close fit for the behavior of the aggregates in a simulated panel that is generated using the individual policy rules. Algan et al (2008Algan et al ( , 2009) and Reiter (2009) parameterize the cross-sectional distribution, which is used to calculate next period's aggregate moments by numerically integrating over the individual choices. These algorithms have in common that (i) an additional function related to an aggregate variable, like a moment or the distribution, is separately parameterized and (ii) information about the crosssectional distribution-obtained by simulating a panel or by parameterizing the distribution-is used to establish a link between the individual and aggregate behavior.…”
Section: Introductionmentioning
confidence: 99%