2010
DOI: 10.21314/jcf.2010.214
|View full text |Cite
|
Sign up to set email alerts
|

The singular points binominal method for pricing American path-dependent options

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
7

Relationship

4
3

Authors

Journals

citations
Cited by 12 publications
(22 citation statements)
references
References 0 publications
0
22
0
Order By: Relevance
“…the expected value of the discounted cash flow obtained not surrendering the contract, and then we can compare it with the payoff of the early surrender case. We solve the problem of pricing simple Ratchet EIAs with early surrender risk using the bivariate tree introduced in the previous section and the framework of the singular points introduced in [7].…”
Section: The Lattice Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…the expected value of the discounted cash flow obtained not surrendering the contract, and then we can compare it with the payoff of the early surrender case. We solve the problem of pricing simple Ratchet EIAs with early surrender risk using the bivariate tree introduced in the previous section and the framework of the singular points introduced in [7].…”
Section: The Lattice Algorithmmentioning
confidence: 99%
“…However, it can be problematic from a computational point of view because of the high number of singular points generated by the procedure. We can use the argument proposed in [7], based on the the convexity of the piecewise linear functions v i,j,k , to reduce drastically such number controlling the error involved in the elimination procedure. Let us remark that deleting some internal points from the sequence of the singular points which characterizes v i,j,k , the new function is still piecewise linear and convex.…”
Section: Inriamentioning
confidence: 99%
See 2 more Smart Citations
“…Among analytical approaches, we mention the Laplace transform approach in Geman and Yor (1993), the spectral expansion derived by Linetsky (2004), and the approximation of the average distribution by …tting integer moments in Turnbull and Wakeman (1991), Lévy (1992), Milevsky and Posner (1998) or logarithmic moments as in Fusai and Tagliani (2002). Another approach uses binomial trees, such as Gaudenzi et al (2007). However, a large number of contracts specify discrete time monitoring, and the impact of the continuous-time assumption can be substantial for some path-dependent derivatives, see for instance the literature on lookback and barrier options, Kat (2001).…”
Section: Introductionmentioning
confidence: 99%