References

PRICING LADDER OPTIONS WITH COMBINATORICS


[1] F. Black and M. Scholes, The pricing of options and corporate liabilities, J. Polit. Econ. 81 (1973), 637-659.

[2] P. Bolye and S. Lau, Bumping up against the barrier with the binomial method, J. Deriv. 1 (1994), 6-14.

[3] P. Chalasani, S. Jha and I. Saias, Approximate option pricing, Algorithmica 25 (1999), 2-21.

[4] J. Cox, S. Ross and M. Rubinstein, Option pricing: A simplified approach, J. Finance Econ. 7 (1979), 229-264.

[5] T. S. Dai and Y. D. Lyuu, Linear-time option pricing algorithms by combinatorics, Computers and Mathematics with Applications 55 (2008), 2142-2157.

[6] T. S. Dai and Y. D. Lyuu, The Bino-trinomial Tree Model-A Simple Model for Efficient and Accurate Option Pricing, Announced in the Asian FA/FMA Meeting, Auckland, New Zealand. 2006.

[7] J. Hull, Options, Futures, and Other Derivatives, 5th ed., Prentice-Hall Press, En- glewood Cliffs, New Jersey, 2003.

[8] J. Hull and A. White, Efficient procedures for valuing European and American path-dependent options, J. Deriv. 1 (1993), 21-31.

[9] Y. D. Lyuu, Financial Engineering and Computation: Principles, Mathematics, Algorithms, Cambridge University Press, Cambridge, UK, 2002.

[10] Y. D. Lyuu, Very fast algorithms for barrier option pricing and the ballot problem, J. Deriv. 5 (1998), 68-79.

[11] Sri Gopal Mohanty, Lattice Path Counting and Applications, Academic Press, New York, 1979.

[12] P. Ritchken, On pricing barrier options, J. Deriv. 3 (1995), 19-28.

[13] Pavel V. Shevchenko, Ladder Options, Working Paper, CSIRO Mathematical and Information Sciences, 2004.

[14] P. G. Zhang, Exotic Options, A Guide to the Second Generation Options (2nd Edition), World Scientific, New York, 1998.