On pricing arithmetic average reset options with multiple reset dates in a lattice framework

We develop a straightforward algorithm to price arithmetic average reset options with multiple reset dates in a Cox et al. (CRR) (1979) [10] framework. The use of a lattice approach is due to its adaptability and flexibility in managing arithmetic average reset options, as already evidenced by Kim et al. (2003) [9]. Their model is based on the Hull and White (1993) [5] bucketing algorithm and uses an exogenous exponential function to manage the averaging feature, but their choice of fictitious values does not guarantee the algorithm’s convergence (cfr., Forsyth et al. (2002) [11]). We propose to overcome this drawback by selecting a limited number of trajectories among the ones reaching each node of the lattice, where we compute effective averages. In this way, the computational cost of the pricing problem is reduced, and the convergence of the discrete time model to the corresponding continuous time one is guaranteed. ► We evaluate arithmetic average reset options with multiple reset dates. ► A lattice-based algorithm is proposed. ► Effective averages are computed on a limited number of selected lattice trajectories. ► The selection procedure reduces the computational cost of the pricing problem. ► Convergence of the lattice model to the continuous time one is guaranteed.