2004
DOI: 10.1007/s10690-005-9005-2
|View full text |Cite
|
Sign up to set email alerts
|

Properties of Multinomial Lattices with Cumulants for Option Pricing and Hedging

Abstract: multinomial lattice, cumulants, excess kurtosis and skewness, compound poisson process, volatility smile,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(20 citation statements)
references
References 37 publications
0
20
0
Order By: Relevance
“…For the multinomial process we follow Yamada and Primbs (2004), Maller, Solomon and Szimayer (2006), and choose a step size and 2M jump sizes given by j for j = 1; ; M: The step size will be determined later. For the jump size x j = j ; y j = j we evaluate the arrival rates…”
Section: Multinomial Approximationsmentioning
confidence: 99%
“…For the multinomial process we follow Yamada and Primbs (2004), Maller, Solomon and Szimayer (2006), and choose a step size and 2M jump sizes given by j for j = 1; ; M: The step size will be determined later. For the jump size x j = j ; y j = j we evaluate the arrival rates…”
Section: Multinomial Approximationsmentioning
confidence: 99%
“…Binomial three model and multinomial tree models, which have more than tree branches at each node, can be also defined in much the same way. The latter ones are useful approximation for a continuous stochastic model with higher moments [9].…”
Section: Solving the Msoh Problemmentioning
confidence: 99%
“…It is known that the more number of branches we take the more approximation accuracy we will obtain [9]. To see the efficiency of the NMSOH problem, two is enough.…”
Section: Numerical Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…Another refinement for such problems, which is recently called the MSOH (mean square optimal hedging) problem, is proposed in, e.g, [5]- [7]. These results mainly improve computational algorithms.…”
Section: Introductionmentioning
confidence: 99%