Binomial options pricing has no closed-form solution
暂无分享,去创建一个
[1] S. Ross,et al. Option pricing: A simplified approach☆ , 1979 .
[2] Peter Paule,et al. A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities , 1995, J. Symb. Comput..
[3] Doron Zeilberger,et al. A maple program for proving hypergeometric identities , 1991, SIGS.
[4] A combinatorial approach for pricing Parisian options , 2002 .
[5] Marc Renault,et al. Lost (and Found) in Translation: André's Actual Method and Its Application to the Generalized Ballot Problem , 2008, Am. Math. Mon..
[6] Yuh-Dauh Lyuu,et al. Very Fast Algorithms for Barrier Option Pricing and the Ballot Problem , 1998 .
[7] R. W. Gosper. Decision procedure for indefinite hypergeometric summation. , 1978, Proceedings of the National Academy of Sciences of the United States of America.
[8] G. Rw. Decision procedure for indefinite hypergeometric summation , 1978 .
[9] Tian-Shyr Dai,et al. Linear-time option pricing algorithms by combinatorics , 2008, Comput. Math. Appl..