We implement a long-horizon static and dynamic portfolio allocation involving a risk-free and a risky asset. This model is calibrated at a quarterly frequency for ten European countries. We also use maximum-likelihood estimates and Bayesian estimates to account for parameter uncertainty. We find...

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...

Recent experience with interest rates hitting the effective lower bound and agents facing binding borrowing constraints has emphasised the importance of understanding the behaviour of an economy in which some variables may be restricted at times. The extended path algorithm is a commonly used...

Much of the trading activity in Equity markets is directed to brokerage houses. In exchange they provide so-called quot;soft dollarsquot; which basically are amounts spent in quot;researchquot; for identifying profitable trading opportunities. Soft dollars represent about USD 1 out of every USD...

We construct the first algorithm for the perfect foresight solution of otherwise linear models with occasionally binding constraints, with fixed terminal conditions, that is guaranteed to return a solution in finite time, if one exists. We also provide a proof of the inescapability of the "curse...

One of the most important factors to control for the achievements of investment portfolio returns is risk. If we only think that a 100% positive return is needed to recover a portfolio loss of 50%, we can understand why. With the advent of the exponential growth of technology usage in markets,...

In this paper we explore the use of Genetic Algorithms (GA) to calibrate seasonal BVAR models. In this way, the mechanistic use of seasonal adjustment procedures is avoided, since seasonality becomes a structural, basic and explicit part of the BVAR model. At the same time, the use of GA allows...

We introduce a novel simulated certainty equivalent approximation (SCEQ) method for solving dynamic stochastic problems. Our examples show that SCEQ can quickly solve high-dimensional finite- or infinite-horizon, stationary or non- stationary dynamic stochastic problems with hundreds of state...

In this paper we outline the Lagrangian constrained optimization method to solve complex problems subject to constraints. Firstly we summarize the Lagrangian constrained optimization routine. Secondly we outline a detailed implementation strategy. Thirdly and finally we provide example and solve...

We show that the standard Value Function Iteration (VFI) algorithm has difficulties approximating models with jump discontinuities in policy functions. We find that VFI fails to accurately identify the location and size of jump discontinuities while other methods - such as the Endogenous Grid...