pith. sign in

arxiv: 1204.0637 · v1 · pith:T3DGLAMAnew · submitted 2012-04-03 · 🧮 math.PR · q-fin.CP· q-fin.PM

Efficient Discretization of Stochastic Integrals

classification 🧮 math.PR q-fin.CPq-fin.PM
keywords asymptoticallycostsefficienttransactionboundsdiscretizationlowerproblem
0
0 comments X
read the original abstract

Sharp asymptotic lower bounds of the expected quadratic variation of discretization error in stochastic integration are given. The theory relies on inequalities for the kurtosis and skewness of a general random variable which are themselves seemingly new. Asymptotically efficient schemes which attain the lower bounds are constructed explicitly. The result is directly applicable to practical hedging problem in mathematical finance; it gives an asymptotically optimal way to choose rebalancing dates and portofolios with respect to transaction costs. The asymptotically efficient strategies in fact reflect the structure of transaction costs. In particular a specific biased rebalancing scheme is shown to be superior to unbiased schemes if transaction costs follow a convex model. The problem is discussed also in terms of the exponential utility maximization.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.