Indirect inference testing can be carried out with a variety of auxiliary models. Asymptotically these different models make no difference. However, in small samples power can differ. We explore small sample power with three different auxiliary models: a VAR, average Impulse Response Functions...

Indirect Inference has been found to have much greater power than the Likelihood Ratio in small samples for testing DSGE models. We look at asymptotic and large sample properties of these tests to understand why this might be the case. We find that the power of the LR test is undermined when...

We test the standard New Keynesian (NK) Dynamic Stochastic General Equilibrium (DSGE) model under the condition with and without inattentive features, where inattentiveness is modelled in the form of sticky information and imperfect information data revision. All models are tested with the...

Indirect inference testing can be carried out with a variety of auxiliary models. Asymptotically these different models make no difference. However, the small sample properties can differ. We explore small sample power and estimation bias both with different variable combinations and descriptive...

Bandwidth plays an important role in determining the performance of local linear estimators. In this paper, we propose a Bayesian approach to bandwidth selection for local linear estimation of time-varying coefficient time series models, where the errors are assumed to follow the Gaussian kernel...

We ask whether Bayesian estimation creates a potential estimation bias as compared with standard estimation techniques based on the data, such as maximum likelihood or indirect estimation. We investigate this with a Monte Carlo experiment in which the true version of a New Keynesian model may...

This paper studies the computational complexity of Bayesian and quasi-Bayesian estimation in large samples carried out using a basic Metropolis random walk. The framework covers cases where the underlying likelihood or extremum criterion function is possibly non-concave, discontinuous, and of...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...