Pricing of American options in discrete time using least squares estimates with complexity penalties

Pricing of American options in discrete time is considered, where the option is allowed to be based on several underlying stocks. It is assumed that the price processes of the underlying stocks are given by Markov processes. We use the Monte Carlo approach to generate artificial sample paths of these price processes, and then we use nonparametric regression estimates to estimate from this data so-called continuation values, which are defined as mean values of the American option for given values of the underlying stocks at time t subject to the constraint that the option is not exercised at time t. As nonparametric regression estimates we use least squares estimates with complexity penalties, which include as special cases least squares spline estimates, least squares neural networks, smoothing splines and orthogonal series estimates. General results concerning rate of convergence are presented and applied to derive results for the special cases mentioned above. Furthermore the pricing of American options is illustrated by simulated data.     

Conditional expectation determination based on the J-process using Malliavin calculus applied to pricing American options

The aim of our paper is to elaborate a theoretical methodology based on the Malliavin calculus to calculate the following conditional expectation (P_t(X_t)|(X_s)) for s≤t where the only state variable follows a J-process [Jerbi Y. A new closed-form solution as an extension of the Black—Scholes formula allowing smile curve plotting. Quant Finance. 2013; Online First Article. doi:10.1080/14697688.2012.762458]. The theoretical results are applied to the American option pricing, consisting of an extension of the work of Bally et al. [Pricing and hedging American options by Monte Carlo methods using a Malliavin calculus approach. Monte Carlo Methods Appl. 2005;11-2:97–133], as well as the J-process (with additional parameters λ and θ) is an extension of the Wiener process. The introduction of the aforesaid parameters induces skewness and kurtosis effects, i.e. smile curve allowing to fit with the reality of financial market. In his work Jerbi [Jerbi Y. A new closed-form solution as an extension of the Black–-Scholes formula allowing smile curve plotting. Quant Finance. 2013; Online First Article. doi:10.1080/14697688.2012.762458] showed that the use of the J-process is equivalent to the use of a stochastic volatility model based on the Wiener process as in Heston's. The present work consists on extending this result to the American options. We studied the influence of the parameters λ and θ on the American option price and we find empirical results fitting with the options theory.     

A sampling plan for one-shot systems considering destructive inspection

Abstract

The paper is concerned with an acceptance sampling problem under destructive inspections for one-shot systems. The systems may fail at random times while they are operating (as the systems are considered to be operating when storage begins), and these failures can only be identified by inspection. Thus, n samples are randomly selected from N one-shot systems for periodic destructive inspection. After storage time T, the N systems are replaced if the number of working systems is less than a pre-specified threshold k. The primary purpose of this study is to determine the optimal number of samples n*, extracted from the N for destructive detection and the optimal acceptance number k*, in the sample under the constraint of the system interval availability, to minimize the expected cost rate. Numerical experiments are studied to investigate the effect of the parameters in sampling inspection on the optimal solutions.     

Explicit formulae and convergence rate for the system M α /G/1/N as N→∞

The paper deals with the system M ^α /G/1/N with a finite number of waiting places in which arrivals can occur in a group. The number of customers in the line and the virtual waiting time are studied both in the transient and in the stationary regime. Special attention is paid to the stationary distributions of these functionals as N→∞. The number of customers lost during a busy period is considered as well.     

A Modified Empirical Martingale Simulation for Financial Derivative Pricing

This article extends the empirical martingale simulation (EMS) method from using a risk-neutral measure to using a dynamic measure for financial derivative pricing. Although the EMS is shown to be capable of obtaining consistent estimate of financial derivative prices in a more efficient way than the standard Monte Carlo simulation procedure, it can proceed only under a risk-neutral framework. In practice, however, it is cumbersome to obtain the explicit expression of a risk-neutral model when dealing with a complex model. To alleviate this difficulty, we compute the financial derivative prices under the dynamic model and impose the martingale property on the simulated sample paths of both the change of measure process and the underlying asset prices under the dynamic P measure. Hence, we call this modification the empirical P-martingale simulation (EPMS). The strong consistency of the EPMS is established and its efficiency is performed by simulation in the GARCH framework. Simulation results shows that EPMS has the similar variance reduction as the EMS method in option pricing if the risk-neutral model can be obtained, and is more efficient than the standard Monte Carlo simulation in most cases.     

Maximizing survival time in a random walk on an interval

A gambler buys N tokens that enable him to play N rounds of the following game. A symmetric random walk on a discrete interval { ? r, …, r} starts from the point 0. The gambler knows only the number of steps made so far, but is unaware of the current position of the walk. Once the walk hits one of the barriers ? r or r for the first time in the current round, the round ends with no payoff. The gambler can start a new round by inserting a new token, if there are any tokens left. The gambler can end the game at any time getting the payoff equal to the number of steps made in the current round. We find the optimal stopping strategy for this game and calculate the expected payoff once the optimal strategy is applied.     

On the arbitrage price of European call options

We show that in a discrete price and discrete time model for option pricing, specifically that given by the Cox–Ross–Rubinstein model, the arbitrage price of a European call option can depend on parameters other than volatility (the standard deviation of the log asset price). We provide two theorems to illustrate this phenomenon. Our first theorem considers two securities with the same volatility so that at a specified time n₀, with probability near 1, the two securities are equal. If their call options differ, both the discounted securities will be martingales. Our second theorem considers two securities with the same volatility so that at times n = 0, ..., N ? 1 the securities are equal with probability near 1. If their call options differ, one of the discounted securities will be a martingale and the other discounted security will be a supermartingale.     

Comparison of PLS algorithms when number of objects is much larger than number of variables

NIPALS and SIMPLS algorithms are the most commonly used algorithms for partial least squares analysis. When the number of objects, N, is much larger than the number of explanatory, K, and/or response variables, M, the NIPALS algorithm can be time consuming. Even though the SIMPLS is not as time consuming as the NIPALS and can be preferred over the NIPALS, there are kernel algorithms developed especially for the cases where N is much larger than number of variables. In this study, the NIPALS, SIMPLS and some kernel algorithms have been used to built partial least squares regression model. Their performances have been compared in terms of the total CPU time spent for the calculations of latent variables, leave-one-out cross validation and bootstrap methods. According to the numerical results, one of the kernel algorithms suggested by Dayal and MacGregor (J Chemom 11:73–85, 1997) is the fastest algorithm.     

Encompassing and indirect inference

Summary In the literature on encompassing [see e.g. Mizon-Richard (1986), Hendry-Richard (1990), Florens-Hendry-Richard (1987)] there is a basic contradiction: on the one hand it is said that it is not possible to assume that the true distribution belongs to one of two competing modelM ₁ andM ₂, but, on the other hand, this assumption is made in the study of encompassing tests. In this paper we first propose a formal definition of encompassing, we then briefly examine the properties of this notion and we propose encompassing tests which do not assume that the true distribution belongs toM ₁ orM ₂; these tests are based on simulations. Finally, generalizing an idea used in the definition of an encompassing test (the GET test) we propose a new kind of inference, called indirect inference, which allows for estimation and test procedures when the model is too complicated to be treated by usual methods (for instance maximum likelihood methods); the only assumption made on the model is that it can be simulated, which seems to be a minimal requirement. This new class of inference methods can be used in a large number of domains and some examples are given. The present paper is based on Gouriéroux-Monfort (1992), and Gouriéroux-Monfort-Renault (1993), respectively GM and GMR hereafter. Invited paper at the Conference on ?Statistical Tests: Methodology and Econometric Applications?, held in Bologna, Italy, 27–28 May 1993.     

An analytical approximation method for pricing barrier options under the double Heston model

Abstract

The purpose of the paper is to provide an efficient pricing method for single barrier options under the double Heston model. By rewriting the model as a singular and regular perturbed BS model, the double Heston model can separately mimic a fast time-scale and a slow time-scale. With the singular and regular perturbation techniques, we analytically derive the first-order asymptotic expansion of the solution to a barrier option pricing partial differential equation. The convergence and efficiency of the approximate method is verified by Monte Carlo simulation. Numerical results show that the presented asymptotic pricing method is fast and accurate.     

Analysis of non-repairable cold-standby systems in Bayes theory

ABSTRACT

In this paper, we seek to analyse the reliability of k-out-of-n cold-standby system with components having Weibull time-to-failure distribution in view of Bayes theory. At first, we review the existing methods exhaustively and find that all these methods have not considered Bayes theory. Then we modify the simplest method and propose new methods based on Monte Carlo simulation. Next, we combine all the information to derive the posterior distribution of Weibull parameters. A robust and universal sample-based method is proposed according to the Monte Carlo Markov Chain method to draw the sample of parameters to obtain the Bayes estimate of reliability. The drawn samples are proved to be rather satisfactory. Conducting a simulation study to compare all the methods in terms of accuracy and computational time, we have presented some useful recommendations from the simulation results. These conclusions would provide insight on the application for k-out-of-n cold-standby system.     

A Note on the Inverse Birthday Problem With Applications

The classical birthday problem considers the probability that at least two people in a group of size N share the same birthday. The inverse birthday problem considers the estimation of the size N of a group given the number of different birthdays in the group. In practice, this problem is analogous to estimating the size of a population from occurrence data only. The inverse problem can be solved via two simple approaches including the method of moments for a multinominal model and the maximum likelihood estimate of a Poisson model, which we present in this study. We investigate properties of both methods and show that they can yield asymptotically equivalent Wald-type interval estimators. Moreover, we show that these methods estimate a lower bound for the population size when birth rates are nonhomogenous or individuals in the population are aggregated. A simulation study was conducted to evaluate the performance of the point estimates arising from the two approaches and to compare the performance of seven interval estimators, including likelihood ratio and log-transformation methods. We illustrate the utility of these methods by estimating: (1) the abundance of tree species over a 50-hectare forest plot, (2) the number of Chlamydia infections when only the number of different birthdays of the patients is known, and (3) the number of rainy days when the number of rainy weeks is known. Supplementary materials for this article are available online.     

Pólya–Aeppli of Order k Risk Model

In this study, we define the Pólya–Aeppli process of order k as a compound Poisson process with truncated geometric compounding distribution with success probability 1 ? ρ > 0 and investigate some of its basic properties. Using simulation, we provide a comparison between the sample paths of the Pólya–Aeppli process of order k and the Poisson process. Also, we consider a risk model in which the claim counting process {N(t)} is a Pólya-Aeppli process of order k, and call it a Pólya—Aeppli of order k risk model. For the Pólya–Aeppli of order k risk model, we derive the ruin probability and the distribution of the deficit at the time of ruin. We discuss in detail the particular case of exponentially distributed claims and provide simulation results for more general cases.     

Valuing equity-indexed annuities with icicled barrier options

Inspired by the recent popularity of autocallable structured products, this paper intends to enhance equity-indexed annuities (EIAs) by introducing a new class of barrier options, termed icicled barrier options. The new class of options has a vertical (icicled) barrier along with the horizontal one of the ordinary barrier options, which may act as an additional knock-in or knock-out trigger. To improve the crediting method of EIAs, we propose a new EIA design, termed autocallable EIA, with payoff structure similar to the autocallable products except for the minimum guarantee, and further investigate the possibility of embedding various icicled barrier options into the plain point-to-point or the ratchet EIAs. Explicit pricing formulas for the proposed EIAs and the icicled barrier options are obtained under the Black–Scholes model. To the purpose, we derive the joint distribution of the logarithmic returns at the icicled time and the maturity, and their running maximum. As an application of the well-known reflection principle, the derivation itself is an interesting probability problem and the joint distribution plays a key role in the subsequent pricing stage. Our option pricing result can be easily transferred to EIAs or other equity-linked products. The pricing formulas for the EIAs and the options are illustrated through numerical examples.     

Pricing arithmetic Asian option under a two-factor stochastic volatility model with jumps

This paper presents an efficient Monte Carlo simulation scheme based on the variance reduction methods to evaluate arithmetic average Asian options in the context of the double Heston's stochastic volatility model with jumps. This paper consists of two essential parts. The first part presents a new flexible stochastic volatility model, namely, the double Heston model with jumps. In the second part, by combining two variance reduction procedures via Monte Carlo simulation, we propose an efficient Monte Carlo simulation scheme for pricing arithmetic average Asian options under the double Heston model with jumps. Numerical results illustrate the efficiency of our method.     

Approximate wavelet-based simulation of long memory processes

In this article, we investigate an algorithm for the fast O(N) and approximate simulation of long memory (LM) processes of length N using the discrete wavelet transform. The algorithm generates stationary processes and is based on the notion that we can improve standard wavelet-based simulation schemes by noting that the decorrelation property of wavelet transforms is not perfect for certain LM process. The method involves the simulation of circular autoregressive process of order one. We demonstrate some of the statistical properties of the processes generated, with some focus on four commonly used LM processes. We compare this simulation method with the white noise wavelet simulation scheme of Percival and Walden [Percival, D. and Walden, A., 2000, Wavelet Methods for Time Series Analysis (Cambridge: Cambridge University Press).].     

Optimal designs for covariates’ models

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. The D-criterion is used to judge the ‘goodness’ of any design for estimating the parameters of this model. Since this criterion is based on the determinant of the information matrix M(d) of a design d, upper bounds for |M(d)| yield lower bounds for the D-efficiency of any design d in estimating the vector of parameters in the model. We consider here only classes of designs d for which the number N of observations to be taken is a multiple of V, that is, there exists R≥2 such that N=V×R.Under these conditions, we determine the maximum of |M(d)|, and conditions under which the maximum is attained. These conditions include R being even, each treatment level being observed the same number of times, that is, R times, and N being a multiple of four. For the other cases of congruence of N (modulo 4) we further determine upper bounds on |M (d)| for equireplicated designs, i.e. for designs with equal number of observations per treatment level. These upper bounds are shown to depend also on the congruence of V (modulo 4). For some triples (N,V,K), the upper bounds determined are shown to be attained.Construction methods yielding families of designs which attain the upper bounds of |M(d)| are presented, for each of the sixteen cases of congruence of N and V.We also determine the upper bound for D-optimal designs for estimating only the treatment parameters, when first order regression on one continuous covariate is present.     

Multivariate signed rank statistics for shift alternatives

Let X ₁,X ₂,…,X _N be successive independent random P-vectors drawn from some continuous diagonally symmetric distribution. The problem of detecting a shift in level of the sequence at an unknown time point M, ≦M ≦ N-1, is studied. Test statistics based on multivariate analogues of the rank statistics derived by BHATTACHARYYA and JOHNSON (1888) are proposed, and their asymptotic properties are investigated.     

De l'unicité des estimateurs robustes en régression lorsque le paramètre d'échelle et le paramètre de la régression sont estimés simultanément

Several methods have been suggested to calculate robust M- and G-M -estimators of the regression parameter β and of the error scale parameter σ in a linear model. This paper shows that, for some data sets well known in robust statistics, the nonlinear systems of equations for the simultaneous estimation of β, with an M-estimate with a redescending ψ-function, and σ, with the residual median absolute deviation (MAD), have many solutions. This multiplicity is not caused by the possible lack of uniqueness, for redescending ψ-functions, of the solutions of the system defining β with known σ; rather, the simultaneous estimation of β and σ together creates the problem. A way to avoid these multiple solutions is to proceed in two steps. First take σ as the median absolute deviation of the residuals for a uniquely defined robust M-estimate such as Huber's Proposal 2 or the L₁-estimate. Then solve the nonlinear system for the M-estimate with σ equal to the value obtained at the first step to get the estimate of β. Analytical conditions for the uniqueness of M and G-M-estimates are also given.     

A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure

In this paper, we study the classification problem of discrete time and continuous time Markov processes with a tree structure. We first show some useful properties associated with the fixed points of a nondecreasing mapping. Mainly we find the conditions for a fixed point to be the minimal fixed point by using fixed point theory and degree theory. We then use these results to identify conditions for Markov chains of M/G/1 type or GI/M/1 type with a tree structure to be positive recurrent, null recurrent, or transient. The results are generalized to Markov chains of matrix M/G/1 type with a tree structure. For all these cases, a relationship between a certain fixed point, the matrix of partial differentiation (Jacobian) associated with the fixed point, and the classification of the Markov chain with a tree structure is established. More specifically, we show that the Perron-Frobenius eigenvalue of the matrix of partial differentiation associated with a certain fixed point provides information for a complete classification of the Markov chains of interest.