At the time of writing this article, Fourier inversion is the computational method of choice for a fast and accurate calculation of plain vanilla option prices in models with an analytically available characteristic function. Shifting the contour of integration along the complex plane allows for...

When using an Euler discretisation to simulate a mean-reverting square root process, one runs into the problem that while the process itself is guaranteed to be nonnegative, the discretisation is not. Although an exact and efficient simulation algorithm exists for this process, at present this...

The characteristic functions of many affine jump-diffusion models, such as Heston’s stochastic volatility model and all of its extensions, involve multivalued functions such as the complex logarithm. If we restrict the logarithm to its principal branch, as is done in most software packages,...

In a standard general equilibrium model it is assumed that there are no price restictions and that prices adjust infinitely fast to their equilibrium values. In this paper the set of admissible prices is allowed to be an arbitrary convex set. For such an arbitrary set it cannot be guaranteed...

This paper points out the importance of Stochastic Dominance (SD) efficient sets being convex. We review

We apply the stochastic evolutionary approach of equilibrium selection to macroeconomic models in which a complementarity at the macro level is present. These models often exhibit multiple Pareto-ranked Nash equilibria, and the best response-correspondence of an individual increases with a...

In a Bayesian analysis, different models can be compared on the basis of the expected or marginal likelihood they attain. Many methods have been devised to compute the marginal likelihood, but simplicity is not the strongest point of most methods. At the same time, the precision of methods is...

In linear-quadratic control (LQC) problems with singular control cost matrix and/or singular transition matrix, we derive a reduction of the dimension of the Riccati matrix, simplifying iteration and solution. Employing a novel transformation, we show that, under a certain rank condition, the...

Adaptive Polar Sampling (APS) is proposed as a Markov chain Monte Carlo method for Bayesian analysis of models with ill-behaved posterior distributions. In order to sample efficiently from such a distribution, a location-scale transformation and a transformation to polar coordinates are used....

This paper provides series expansions of the stationary distribution of a finite Markov chain. This leads to an efficient numerical algorithm for computing the stationary distribution of a finite Markov chain. Numerical examples are given to illustrate the performance of the algorithm.