Following Lancaster (2002), we propose a strategy to solve the incidental parameter problem. The method is demonstrated under a simple panel Poisson count model. We also extend the strategy to accomodate cases when information orthogonality is unavailable, such as the linear AR(p) panel model....

This paper analyzes house price data belonging to three hierarchical levels of spatial units. House selling prices with associated individual attributes (the elementary level-1) are grouped within municipalities (level-2), which form districts (level-3), which are themselves nested in counties...

This paper picks up on a model developed by Philipov and Glickman (2006) for modeling multivariate stochastic volatility via Wishart processes. MCMC simulation from the posterior distribution is employed to fit the model. However, erroneous mathematical transformations in the full conditionals...

This paper analyzes Structural Vector Autoregressions (SVARs) where identification of structural parameters holds locally but not globally. In this case there exists a set of isolated structural parameter points that are observationally equivalent under the imposed restrictions. Although the...

This paper analyzes Structural Vector Autoregressions (SVARs) where identification of structural parameters holds locally but not globally. In this case there exists a set of isolated structural parameter points that are observationally equivalent under the imposed restrictions. Although the...

Quantitative investment strategies are often selected from a broad class of candidate models estimated and tested on historical data. Standard statistical technique to prevent model overfitting such as out-sample back-testing turns out to be unreliable in the situation when selection is based on...

We analyze Granger causality testing in a mixed-frequency VAR, where the difference in sampling frequencies of the variables is large. Given a realistic sample size, the number of high-frequency observations per low-frequency period leads to parameter proliferation problems in case we attempt to...

We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using...

We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using...

The computing time for Markov Chain Monte Carlo (MCMC) algorithms can be prohibitively large for datasets with many observations, especially when the data density for each observation is costly to evaluate. We propose a framework where the likelihood function is estimated from a random subset of...