Computational Methods for Pricing American Put Options

This work develops computational methods for pricing American put options under a Markov-switching diffusion market model. Two methods are suggested in this paper. The first method is a stochastic approximation approach. It can handle option pricing in a finite horizon, which is particularly useful in practice and provides a systematic approach. It does not require calibration of the system parameters nor estimation of the states of the switching process. Asymptotic results of the recursive algorithms are developed. The second method is based on a selling rule for the liquidation of a stock for perpetual options. Numerical results using stochastic approximation and Monte Carlo simulation are reported. Comparisons of different methods are made. This research was supported in part by the National Science Foundation and in part by the Wayne State University Research Enhancement Program.     

Inference of statistical bounds for multistage stochastic programming problems

We discuss in this paper statistical inference of sample average approximations of multistage stochastic programming problems. We show that any random sampling scheme provides a valid statistical lower bound for the optimal (minimum) value of the true problem. However, in order for such lower bound to be consistent one needs to employ the conditional sampling procedure. We also indicate that fixing a feasible first-stage solution and then solving the sampling approximation of the corresponding (T–1)-stage problem, does not give a valid statistical upper bound for the optimal value of the true problem.Supported, in part, by the National Science Foundation under grant DMS-0073770.     

AN OPTION PRICING PROBLEM WITH THEUNDERLYING STOCK PAY1NG DIVIDENDS~

In this paper, a pricing problem of European call options is considered, wbete the underlying stock generates dividends d, at some fixed future dates T, before the expiration date T .without the inappropriate assumption made in that the dlvkdeMs being payed continously.The arbitrage free pricing of the option is determined via a series of partial differential equations.which is derived at the view point of backward s‘tochasric differential ertuation (BBDE). It isshowed how the dividends affect the fair price of the call options. Some simulating results are alsogiven to illust rate the respective in fluence of parameters a.T.r,K.di and F1 on the option pricing.     

Carr's randomization for American options in regime-switching models

In the paper, we solve the pricing problem for American put-like options in Markov-modulated Lévy models. The early exercise boundaries and prices are calculated using a generalization of Carr's randomization for regime-switching models. An efficient iteration pricing procedure is developed. The computational time is of order m², where m is the number of states, and of order m, if the parallel computations are allowed. The payoffs, riskless rates and class of Lévy processes may depend on a state. Special cases are stochastic volatility models and models with stochastic interest rate; both must be modelled as finite-state Markov chains. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Pricing problems with a continuum of customers as stochastic Stackelberg games

The pricing problem where a company sells a certain kind of product to a continuum of customers is considered. It is formulated as a stochastic Stackelberg game with nonnested information structure. The inducible region concept, recently developed for deterministic Stackelberg games, is extended to treat the stochastic pricing problem. Necessary and sufficient conditions for a pricing scheme to be optimal are derived, and the pricing problem is solved by first delineating its inducible region, and then solving a constrained optimal control problem.The research work reported here as supported in part by the National Science Foundation under Grant ECS-81-05984, Grant ECS-82-10673, and by the Air Force Office of Scientific Research under AFOSR Grant 80-0098.     

Pricing currency options under two-factor Markov-modulated stochastic volatility models

This article investigates the valuation of currency options when the dynamic of the spot Foreign Exchange (FX) rate is governed by a two-factor Markov-modulated stochastic volatility model, with the first stochastic volatility component driven by a lognormal diffusion process and the second independent stochastic volatility component driven by a continuous-time finite-state Markov chain model. The states of the Markov chain can be interpreted as the states of an economy. We employ the regime-switching Esscher transform to determine a martingale pricing measure for valuing currency options under the incomplete market setting. We consider the valuation of the European-style and American-style currency options. In the case of American options, we provide a decomposition result for the American option price into the sum of its European counterpart and the early exercise premium. Numerical results are included.     

A BLACK-SCHOLES FORMULA FOR OPTION PRICING WITH DIVIDENDS

Abstract. We obtain a Black-Scholes formula for the arbitrage-free pricing of Eu-ropean Call options with constant coefficients when the underlylng stock generatesdividends. To hedge the Call option, we will always borrow money from bank. We seethe influence of the dividend term on the option pricing via the comparison theoremof BSDE(backward stochastic di~erential equation [5], [7]). We also consider the option pricing problem in terms of the borrowing rate R whichis not equal to the interest rate r. The corresponding Black-Sdxoles formula is given.We notice that it is in fact the borrowing rate that plays the role in the pricing formula.     

How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths

Stochastic optimization/approximation algorithms are widely used to recursively estimate the optimum of a suitable function or its root under noisy observations when this optimum or root is a constant or evolves randomly according to slowly time-varying continuous sample paths. In comparison, this paper analyzes the asymptotic properties of stochastic optimization/approximation algorithms for recursively estimating the optimum or root when it evolves rapidly with nonsmooth (jump-changing) sample paths. The resulting problem falls into the category of regime-switching stochastic approximation algorithms with two-time scales. Motivated by emerging applications in wireless communications, and system identification, we analyze asymptotic behavior of such algorithms. Our analysis assumes that the noisy observations contain a (nonsmooth) jump process modeled by a discrete-time Markov chain whose transition frequency varies much faster than the adaptation rate of the stochastic optimization algorithm. Using stochastic averaging, we prove convergence of the algorithm. Rate of convergence of the algorithm is obtained via bounds on the estimation errors and diffusion approximations. Remarks on improving the convergence rates through iterate averaging, and limit mean dynamics represented by differential inclusions are also presented. The research of G. Yin was supported in part by the National Science Foundation under DMS-0603287, in part by the National Security Agency under MSPF-068-029, and in part by the National Natural Science Foundation of China under #60574069. The research of C. Ion was supported in part by the Wayne State University Rumble Fellowship. The research of V. Krishnamurthy was supported in part by NSERC (Canada).     

Pricing Options under Two-Factor Markov-Modulated Stochastic Volatility Models

In this paper, we investigate the valuation of European-style call options under an extended two-factor Markov-modulated stochastic volatility model, where the first stochastic volatility component is driven by a mean-reversion square-root process and the second stochastic volatility component is modulated by a continuous-time, finite-state Markov chain. The inverse Fourier transform is adopted to obtain analytical pricing formulae. Numerical examples are given to illustrate the discretization of the pricing formulae and the implementation of our model.     

Denumerable controlled Markov chains with average reward criterion: Sample path optimality

We consider discrete-time nonlinear controlled stochastic systems, modeled by controlled Makov chains with denumerable state space and compact action space. The corresponding stochastic control problem of maximizing average rewards in the long-run is studied. Departing from the most common position which usesexpected values of rewards, we focus on a sample path analysis of the stream of states/rewards. Under a Lyapunov function condition, we show that stationary policies obtained from the average reward optimality equation are not only average reward optimal, but indeed sample path average reward optimal, for almost all sample paths.Research supported by a U.S.-México Collaborative Research Program funded by the National Science Foundation under grant NSF-INT 9201430, and by CONACyT-MEXICO.Partially supported by the MAXTOR Foundation for applied Probability and Statistics, under grant No. 01-01-56/04-93.Research partially supported by the Engineering Foundation under grant RI-A-93-10, and by a grant from the AT&T Foundation.     

Analysis of effective service time with age dependent interruptions and its application to optimal rollback policy for database management

A stochastic model is developed describing a service system subject to inhomogeneous Poisson interruptions with age dependent interruption periods. By studying the probabilistic flow of the underlying multivariate Markov process, the Laplace transform of the effective service time is explicitly obtained. For general renewal interruptions, only the expected effective service time is derived. As an application, an optimal checkpoint policy is examined for database management. It is shown that an optimal policy maximizing the ergodic availability of the database is to implement a checkpoint as soon as the cumulative uptime of the database reaches a prespecified constantk ^*. A computational procedure is then developed for findingk ^* and numerical results are exhibited.This work was supported in part by the National Science Foundation under Grant No. ECS-8600992 and by the IBM Program of Support for Education in the Management of Information Systems.     

Large deviations and importance sampling for a tandem network with slow-down

We consider a variant of the two-node tandem Jackson network where the upstream server reduces its service rate when the downstream queue exceeds some prespecified threshold. The rare event of interest is the overflow of the downstream queue. Based on a game/subsolution approach, we rigorously identify the exponential decay rate of the rare event probabilities and construct asymptotically optimal importance sampling schemes. Research of P. Dupuis supported in part by the National Science Foundation (NSF-DMS-0404806 and NSF-DMS-0706003) and the Army Research Office (W911NF-05-1-0289). Research of K. Leder supported in part by the National Science Foundation (NSF-DMS-0404806 and NSF-DMS-0706003). Research of H. Wang supported in part by the National Science Foundation (NSF-DMS-0404806 and NSF-DMS-0706003).     

On the pricing of American options

The problem of valuation for contingent claims that can be exercised at any time before or at maturity, such as American options, is discussed in the manner of Bensoussan [1]. We offer an approach which both simplifies and extends the results of existing theory on this topic.Research supported in part by the National Science Foundation under Grant No. NSF-DMS-84-16736 and by the Air Force Office of Scientific Research under Grant No. F49620-85-C-0144.     

Weighted median algorithms for L1 approximation

The weighted median problem arises as a subproblem in certain multivariate optimization problems, includingL ₁ approximation. Three algorithms for the weighted median problem are presented and the relationships between them are discussed. We report on computational experience with these algorithms and on their use in the context of multivariateL ₁ approximation.This work was supported in part by National Science Foundation Grant CCR-8713893 and in part by a grant from The City University of New York PSC-CUNY Research Award program.     

Models and model value in stochastic programming

Finding optimal decisions often involves the consideration of certain random or unknown parameters. A standard approach is to replace the random parameters by the expectations and to solve a deterministic mathematical program. A second approach is to consider possible future scenarios and the decision that would be best under each of these scenarios. The question then becomes how to choose among these alternatives. Both approaches may produce solutions that are far from optimal in the stochastic programming model that explicitly includes the random parameters. In this paper, we illustrate this advantage of a stochastic program model through two examples that are representative of the range of problems considered in stochastic programming. The paper focuses on the relative value of the stochastic program solution over a deterministic problem solution.The author's work was supported in part by the National Science Foundation under Grant DDM-9215921.     

Perpetual American maximum options with Markov-modulated dynamics

In this paper, we deal with the valuation problem of two-asset perpetual American maximum options with Markov-modulated dynamics, in which the asset price processes are driven by a hidden Markov chain. We give the optimal stopping time rule and derive explicit pricing formulas by solving a series of variational inequalities. A proof of optimality for the result is performed in the end.     

Infinitesimal perturbation analysis for second derivative estimation and design of manufacturing flow controllers

A simulation-based numerical technique for the design of near-optimal manufacturing flow controllers for unreliable flexible manufacturing systems uses quadratic approximations of the value functions that characterize the optimal policy and employs stochastic optimization to design the key coefficients of the quadratic approximations. First and second derivative estimates that drive the optimization algorithm are obtained from a single sample path of the system via infinitesimal perturbation analysis (IPA). Extensive computational experience is reported for one, two, and three-part-type production systems. The relative performance of first-order and second-order stochastic optimization algorithms is investigated. The computational efficiency of these algorithms is finally compared to conventional controller design algorithms based on state-space discretization and successive approximation.This research was supported by the National Science Foundation, Grant No. DDM-89-14277 and DDM-9215368.     

Using stochastic optimization to determine threshold values for the control of unreliable manufacturing systems

A manufacturing system with two tandem machines producing one part type is considered in this work. The machines are unreliable, each having two states, up and down. Both surplus controls and Kanban systems are considered. Algorithms for approximating the optimal threshold values are developed. First, perturbation analysis techniques are employed to obtain consistent gradient estimates based on a single simulation run. Then, iterative algorithms of the stochastic optimization type are constructed. It is shown that the algorithms converge to the optimal threshold values in an appropriate sense. Numerical examples are provided to demonstrate the performance of the algorithms.The research of these authors was supported in part by grants from URIF, MRCO, National Science Foundation, and Wayne State University. The authors would like to thank Dr. X. R. Cao, Digital Equipment Corporation, for the valuable initial discussion and Dr. X. Y. Zhou, University of Toronto, for his helpful comments.     

Superconvergence estimates of finite element methods for American options

In this paper we are concerned with finite element approximations to the evaluation of American options. First, following W. Allegretto etc., SIAM J. Numer. Anal. 39 (2001), 834–857, we introduce a novel practical approach to the discussed problem, which involves the exact reformulation of the original problem and the implementation of the numerical solution over a very small region so that this algorithm is very rapid and highly accurate. Secondly by means of a superapproximation and interpolation postprocessing analysis technique, we present sharp L ²-, L ^∞-norm error estimates and an H ¹-norm superconvergence estimate for this finite element method. As a by-product, the global superconvergence result can be used to generate an efficient a posteriori error estimator. This work was supported in part by the National Natural Science Foundation of China (10471103 and 10771158), the National Basic Research Program (2007CB814906), Social Science Foundation of the Ministry of Education of China (Numerical Methods for Convertible Bonds, 06JA630047), Tianjin Natural Science Foundation (07JCY-BJC14300), and Tianjin University of Finance and Economics.     

Near optimality of stochastic control in systems with unknown parameter processes

Stochastic control for systems with an unknown parameter is considered in this paper. The underlying problem is to minimize a functional subject to a system described by a singularly perturbed differential equation with an unknown parameter process driven by fast fluctuating random disturbances. This problem arises in the context of stochastic adaptive control, adaptive signal processing, and failure-prone manufacturing systems. Due to the nature of the wide-bandwidth noise processes, identifying the parameter process for eacht is very hard since the driving noise changes very rapidly. An alternative approach is used, and an auxiliary control problem is introduced to overcome the difficulties. By means of weak convergence methods and comparison control techniques, nearly optimal controls are obtained.This research was supported in part by the National Science Foundation under Grant DMS-9022139 and DMS-9224372.