Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Numerical Simulation of Quanto Option Prices Using Bayesian Statistical Methods
81
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In the paper, the pricing of Quanto options is studied, where the underlying foreign asset and the exchange rate are correlated with each other. Firstly, we adopt Bayesian methods to estimate unknown parameters entering the pricing formula of Quanto options, including the volatility of stock, the volatility of exchange rate and the correlation. Secondly, we compute and predict prices of different four types of Quanto options based on Bayesian posterior prediction techniques and Monte Carlo methods. Finally, we provide numerical simulations to demonstrate the advantage of Bayesian method used in this paper comparing with some other existing methods. This paper is a new application of the Bayesian methods in the pricing of multi-asset options.
rate research
Read More
In the present paper, a decomposition formula for the call price due to Al`{o}s is transformed into a Taylor type formula containing an infinite series with stochastic terms. The new decomposition may be considered as an alternative to the decomposition of the call price found in a recent paper of Al`{o}s, Gatheral and Radoiv{c}i{c}. We use the new decomposition to obtain various approximations to the call price in the Heston model with sharper estimates of the error term than in the previously known approximations. One of the formulas obtained in the present paper has five significant terms and an error estimate of the form $O( u^{3}(left|rhoright|+ u))$, where $ u$ is the vol-vol parameter, and $rho$ is the correlation coefficient between the price and the volatility in the Heston model. Another approximation formula contains seven more terms and the error estimate is of the form $O( u^4(1+|rho|)$. For the uncorrelated Hestom model ($rho=0$), we obtain a formula with four significant terms and an error estimate $O( u^6)$. Numerical experiments show that the new approximations to the call price perform especially well in the high volatility mode.
We propose a general, very fast method to quickly approximate the solution of a parabolic Partial Differential Equation (PDEs) with explicit formulas. Our method also provides equaly fast approximations of the derivatives of the solution, which is a challenge for many other methods. Our approach is based on a computable series expansion in terms of a small parameter. As an example, we treat in detail the important case of the SABR PDE for $beta = 1$, namely $partial_{tau}u = sigma^2 big [ frac{1}{2} (partial^2_xu - partial_xu) + u rho partial_xpartial_sigma u + frac{1}{2} u^2 partial^2_sigma u , big ] + kappa (theta - sigma) partial_sigma$, by choosing $ u$ as small parameter. This yields $u = u_0 + u u_1 + u^2 u_2 + ldots$, with $u_j$ independent of $ u$. The terms $u_j$ are explicitly computable, which is also a challenge for many other, related methods. Truncating this expansion leads to computable approximations of $u$ that are in closed form, and hence can be evaluated very quickly. Most of the other related methods use the time $tau$ as a small parameter. The advantage of our method is that it leads to shorter and hence easier to determine and to generalize formulas. We obtain also an explicit expansion for the implied volatility in the SABR model in terms of $ u$, similar to Hagans formula, but including also the {em mean reverting term.} We provide several numerical tests that show the performance of our method. In particular, we compare our formula to the one due to Hagan. Our results also behave well when used for actual market data and show the mean reverting property of the volatility.
GPU computing has become popular in computational finance and many financial institutions are moving their CPU based applications to the GPU platform. Since most Monte Carlo algorithms are embarrassingly parallel, they benefit greatly from parallel implementations, and consequently Monte Carlo has become a focal point in GPU computing. GPU speed-up examples reported in the literature often involve Monte Carlo algorithms, and there are software tools commercially available that help migrate Monte Carlo financial pricing models to GPU. We present a survey of Monte Carlo and randomized quasi-Monte Carlo methods, and discuss existing (quasi) Monte Carlo sequences in GPU libraries. We discuss specific features of GPU architecture relevant for developing efficient (quasi) Monte Carlo methods. We introduce a recent randomized quasi-Monte Carlo method, and compare it with some of the existing implementations on GPU, when they are used in pricing caplets in the LIBOR market model and mortgage backed securities.
In this paper we modify the model of Itkin, Shcherbakov and Veygman, (2019) (ISV2019), proposed for pricing Quanto Credit Default Swaps (CDS) and risky bonds, in several ways. First, it is known since the Lehman Brothers bankruptcy that the recovery rate could significantly vary right before or at default, therefore, in this paper we consider it to be stochastic. Second, to reduce complexity of the model, we treat the domestic interest rate as deterministic, because, as shown in ISV2019, volatility of the domestic interest rate does not contribute much to the value of the Quanto CDS spread. Finally, to solve the corresponding systems of 4D partial differential equations we use a different flavor of the Radial Basis Function (RBF) method which is a combination of localized RBF and finite-difference methods, and is known in the literature as RBF-FD. Results of our numerical experiments presented in the paper demonstrate that the influence of volatility of the recovery rate is significant if the correlation between the recovery rate and the log-intensity of the default is non-zero. Also, the impact of the recovery mean-reversion rate on the Quanto CDS spread could be comparable with the impact due to jump-at-default in the FX rate.
Option price data are used as inputs for model calibration, risk-neutral density estimation and many other financial applications. The presence of arbitrage in option price data can lead to poor performance or even failure of these tasks, making pre-processing of the data to eliminate arbitrage necessary. Most attention in the relevant literature has been devoted to arbitrage-free smoothing and filtering (i.e. removing) of data. In contrast to smoothing, which typically changes nearly all data, or filtering, which truncates data, we propose to repair data by only necessary and minimal changes. We formulate the data repair as a linear programming (LP) problem, where the no-arbitrage relations are constraints, and the objective is to minimise prices changes within their bid and ask price bounds. Through empirical studies, we show that the proposed arbitrage repair method gives sparse perturbations on data, and is fast when applied to real world large-scale problems due to the LP formulation. In addition, we show that removing arbitrage from prices data by our repair method can improve model calibration with enhanced robustness and reduced calibration error.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
