SEQUENTIAL MONTE CARLO SAMPLING FOR DSGE MODELS

We develop a sequential Monte Carlo (SMC) algorithm for estimating Bayesian dynamic stochastic general equilibrium (DSGE) models; wherein a particle approximation to the posterior is built iteratively through tempering the likelihood. Using two empirical illustrations consisting of the Smets and Wou...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of applied econometrics (Chichester, England) Ročník 29; číslo 7; s. 1073 - 1098
Hlavní autori: Herbst, Edward, Schorfheide, Frank
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Chichester Blackwell Publishing Ltd 01.11.2014
Wiley (Variant)
Wiley-Blackwell
Wiley Periodicals Inc
Predmet:
Algorithms
Bayesian analysis
Bayesian method
Dynamisches Gleichgewicht
Economic models
Economic shock
Function words
General economic equilibrium
Inference
Markov analysis
Markovian processes
Monte Carlo simulation
Random walk theory
Sampling
Schätztheorie
Stichprobenerhebung
Stochastic models
Stochastic processes
Studies
Theorie
Working hours
ISSN:0883-7252, 1099-1255
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We develop a sequential Monte Carlo (SMC) algorithm for estimating Bayesian dynamic stochastic general equilibrium (DSGE) models; wherein a particle approximation to the posterior is built iteratively through tempering the likelihood. Using two empirical illustrations consisting of the Smets and Wouters model and a larger news shock model we show that the SMC algorithm is better suited for multimodal and irregular posterior distributions than the widely used random walk Metropolis–Hastings algorithm. We find that a more diffuse prior for the Smets and Wouters model improves its marginal data density and that a slight modification of the prior for the news shock model leads to drastic changes in the posterior inference about the importance of news shocks for fluctuations in hours worked. Unlike standard Markov chain Monte Carlo (MCMC) techniques; the SMC algorithm is well suited for parallel computing.
Bibliografia:ArticleID:JAE2397
istex:DE9B276C0A94C607F9CC70E0572D30EAEC0A1BD4
ark:/67375/WNG-K23NB1KS-H
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0883-7252
1099-1255
DOI:10.1002/jae.2397