Show simple item record

dc.contributor.authorWang, Xuyan 18:22:08 (GMT) 18:22:08 (GMT)
dc.description.abstractLookback option is a well-known path-dependent option where its payoff depends on the historical extremum prices. The thesis focuses on the binomial pricing of the American floating strike lookback put options with payoff at time $t$ (if exercise) characterized by \[ \max_{k=0, \ldots, t} S_k - S_t, \] where $S_t$ denotes the price of the underlying stock at time $t$. Build upon the idea of \hyperlink{RBCV}{Reiner Babbs Cheuk and Vorst} (RBCV, 1992) who proposed a transformed binomial lattice model for efficient pricing of this class of option, this thesis extends and enhances their binomial recursive algorithm by exploiting the additional combinatorial properties of the lattice structure. The proposed algorithm is not only computational efficient but it also significantly reduces the memory constraint. As a result, the proposed algorithm is more than 1000 times faster than the original RBCV algorithm and it can compute a binomial lattice with one million time steps in less than two seconds. This algorithm enables us to extrapolate the limiting (American) option value up to 4 or 5 decimal accuracy in real time.en
dc.format.extent593753 bytes
dc.publisherUniversity of Waterlooen
dc.subjectAmerican Lookback Put Optionen
dc.subjectBinomial Lattice Modelen
dc.subjectexercise barrieren
dc.subjectexercise propagationen
dc.titleEfficient Procedure for Valuing American Lookback Put Optionsen
dc.typeMaster Thesisen
dc.subject.programActuarial Scienceen and Actuarial Scienceen
uws-etd.degreeMaster of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages