A weak approximation with asymptotic expansion and multidimensional Malliavin weights
نویسندگان
چکیده
منابع مشابه
An Asymptotic Expansion with Push-Down of Malliavin Weights
This paper derives asymptotic expansion formulas for option prices and implied volatilities as well as the density of the underlying asset price in multi-dimensional stochastic volatility models. In particular, the integration-byparts formula in Malliavin calculus and the push-down of Malliavin weights are effectively applied. We provide an expansion formula for generalized Wiener functionals a...
متن کاملMalliavin calculus and asymptotic expansion for martingales
We present an asymptotic expansion of the distribution of a random variable which admits a stochastic expansion around a continuous martingale. The emphasis is put on the use of the Malliavin calculus; the uniform nondegeneracy of the Malliavin covariance under certain truncation plays an essential role as the Crame r condition did in the case of independent observations. Applications to stati...
متن کاملMalliavin Calculus Method for Asymptotic Expansion of Dual Control Problems
We develop a technique based on Malliavin-Bismut calculus ideas, for asymptotic expansion of dual control problems arising in connection with exponential indifference valuation of claims, and with minimisation of relative entropy, in incomplete markets. The problems involve optimisation of a functional of Brownian paths on Wiener space, with the paths perturbed by a drift involving the control....
متن کاملZero Weights in Weak Efficient and Inefficient Points with AHP
In this paper an approach in data envelopment analysis dealing with evaluation of non – zero slacks was propounded. This approach intends that weight of inefficient and weak efficient points that have been evaluated as zero weight, be considered as positive weight, and also in this approach, the pareto efficiency evaluates the picture of this point. In this approach positive weights in the i...
متن کاملMultidimensional Approximation Algorithms for Capacity-Expansion Problems
We develop multi-dimensional balancing algorithms to compute provably near-optimal capacity-expansion policies. These are the first approximation algorithms for multi-machine, multi-product systems facing stochastic, non-stationary and correlated demands. Our approach is computationally efficient and guaranteed to produce a policy with total expected cost no more than twice that of an optimal p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2016
ISSN: 1050-5164
DOI: 10.1214/15-aap1105