We show how it is possible to generate multivariate data which have moments arbitrary close to the desired ones. They are generated as linear combinations of variables with known theoretical moments. It is shown how to derive the weights of the linear combinations in both the univariate and the...

We show how it is possible to generate multivariate data which have moments arbitrary close to the desired ones. They are generated as linear combinations of variables with known theoretical moments. It is shown how to derive the weights of the linear combinations in both the univariate and the...

This note examines the accuracy of methods that are commonly used to approximate AR(1)-processes with discrete Markov chains. The quadrature-based method suggested by Tauchen and Hussey (1991) generates excellent approximations with a small number of nodes when the autocorrelation is low or...

This note examines the accuracy of methods that are commonly used to approximate AR(1)-processes with discrete Markov chains. The quadrature-based method suggested by Tauchen and Hussey (1991) generates excellent approximations with a small number of nodes when the autocorrelation is low or...

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is...

The full Bayesian treatment of error component models typically relies on data augmentation to produce the required inference. Never stricly necessary a direct approach is always possible though not necessarily practical. The mechanics of direct sampling are outlined and a template for including...

Bayesian inference for DSGE models is typically carried out by single block random walk Metropolis, involving very high computing costs. This paper combines two features, adaptive independent Metropolis-Hastings and parallelisation, to achieve large computational gains in DSGE model estimation....

Bernardo and Ledoit (2000) develop a very appealing framework to compute pricing bounds based on the so-called gain-loss ratio. Their method has many advantages and very interesting properties and so far one important drawback: the complexity of the numerical computation of the pricing bounds....

In a two-period setup we develop a generalization of good-deal bounds that allows to include in the problem the implications of asset pricing models. Our basis is the distance behind Hansen and Jagannathan's measure of model misspecification since a volatility constraint on the stochastic...

Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based on the idea of evaluating the posterior in parallel and ahead of time. Improved Metropolis-Hastings prefetching algorithms are presented and evaluated. It is shown how to use...