Computationally simple lattice methods for option and bond pricing

We propose new lattice-based algorithms for option and bond pricing, which rely on computationally simple trees, i.e., trees with the number of nodes that grows at most linearly in the number of time intervals. Contrary to commonly used methods, the target diffusion is approximated directly, without having to transform the original process into a constant volatility process. The discrete approximating process converges to the target continuous process, and the proposed algorithms are shown to be efficient and accurate for pricing purposes.