This paper presents the parallel computing implementation of the MitISEM algorithm, labeled Parallel MitISEM. The basic MitISEM algorithm, introduced by Hoogerheide, Opschoor and Van Dijk (2012), provides an automatic and flexible method to approximate a non-elliptical target density using...

Making use of restrictions imposed by equilibrium, theoretical progress has been made on the nonparametric and semiparametric estimation and identification of scalar additive hedonic models (Ekeland, Heckman, and Nesheim, 2002) and scalar nonadditive hedonic models (Heckman, Matzkin, and...

This paper considers the identification and estimation of hedonic models. We establish that in an additive version of the hedonic model, technology and preferences are generically identified up to affine transformations from data on demand and supply in a single hedonic market. For a very...

We develop a multivariate unobserved components model to extract business cycle and financial cycle indicators from a panel of economic and financial time series of four large developed economies. Our model is flexible and allows for the inclusion of cycle components in different selections of...

We propose a novel multivariate GARCH model that incorporates realized measures for the variance matrix of returns. The key novelty is the joint formulation of a multivariate dynamic model for outer-products of returns, realized variances and realized covariances. The updating of the variance...

This paper presents results of a meta-regression analysis on empirical estimates of capital-energy substitution. Theoretically it is clear that a distinction should be made between Morishima substitution elasticities and cross-price elasticities. The former represent purely technical...

This study models the choices of Dutch railway users (aggregated at the 4 digit post code area) for access mode and departure railway stations. For each post code area a set of four access modes: car, public transport, bicycle and walking and a set three departure railway stations are...