We propose a new lattice based algorithm for option and bond pricing which relies on computationally simple trees ,i.e., trees with the number of nodes that grows at most linearly in the number of time intervals. The discrete approximating process is shown to converge to the target continuous process. The proposed model is efficient and accurate with respect to other existing pricing models.
Computationally simple lattice methods for option and bond pricing
COSTABILE, Massimo;LECCADITO, ARTURO;MASSABO', Ivar
2009-01-01
Abstract
We propose a new lattice based algorithm for option and bond pricing which relies on computationally simple trees ,i.e., trees with the number of nodes that grows at most linearly in the number of time intervals. The discrete approximating process is shown to converge to the target continuous process. The proposed model is efficient and accurate with respect to other existing pricing models.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
