Comonotonicity.

Comonotonicity;

Bounds for the price of discrete arithmetic Asian options.

In this paper the pricing of European-style discrete arithmetic Asian options with fixed and floating strike is studied by deriving analytical lower and upper bounds. In our approach we use a general technique for deriving upper (and lower) bounds for stop-loss premiums of sums of dependent random variables, as explained in Kaas, Dhaene and Goovaerts (2000), and additionally, the ideas of Rogers and Shi (1995) and of Nielsen and Sandmann (2003). We are able to create a unifying framework for discrete Asian options through these bounds, that generalizes several approaches in the literature as well as improves the existing results. We obtain analytical and easily computable bounds. The aim of the paper is to formulate an advice of the appropriate choice of the bounds given the parameters, investigate the effect of different conditioning variables and compare their efficiency numerically. Several sets of numerical results are included. We also show that the hedging using these bounds is possible. Moreover, our methods are applicable to a wide range of (pricing) problems involving a sum of dependent random variables.Asian option; Choice; Efficiency; Framework; Hedging; Methods; Options; Premium; Pricing; Problems; Random variables; Research; Stop-loss premium; Variables;

Bounds for the Price of a European-style Asian Option in a Binary Tree Model

info:eu-repo/semantics/publishe

Bounds for the price of a European-style Asian option in a binary tree model

derived accurate lower and upper bounds for the price of a European-style Asian option with continuous averaging over the full lifetime of the option, using a discrete-time binary tree model. In this paper, we consider arithmetic Asian options with discrete sampling and we generalize their method to the case of forward starting Asian options. In this case with daily time steps, the method of Chalasani et al. is still very accurate but the computation can take a very long time on a PC when the number of steps in the binomial tree is high. We derive analytical lower and upper bounds based on the approach of Kaas, Dhaene & Goovaerts (2000) for bounds for stop-loss premiums of sums of dependent random variables, and by conditioning on the value of the underlying at the exercise date. By putting in less information than Chalasani et al. the bounds lose some accuracy but are still very good and they are easily computable and moreover the computation on a PC is fast. We illustrate our results by different numerical experiments and compare with bounds for the Black & Scholes model (1973) found in another paper Vanmaele et al. (2002). We notice that the intervals of Chalasani et al. do not always lie within the Black & Scholes intervals. We have proved that our bounds converge to the corresponding bounds in the Black & Scholes model

Bounds for the price of a European-style Asian option in a binary tree model

info:eu-repo/semantics/publishe