Linear-time option pricing algorithms by combinatorics (Q2483085): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2007.08.046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011575244 / rank
 
Normal rank

Revision as of 21:58, 19 March 2024

scientific article
Language Label Description Also known as
English
Linear-time option pricing algorithms by combinatorics
scientific article

    Statements

    Linear-time option pricing algorithms by combinatorics (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2008
    0 references
    This paper deals with option price for the log-normal stock process. Since most options can not be evaluated analytically, they must be priced by numerical methods. The lattice model is used mainly, namely the time interval from initial to mature is divided into \(n\) times steps and stock price is discretelized at each time step. For efficient computation, the authors applied combinatorial technique and showed how their combinatorial algorithms improved the speed of calculations for various lattice models, when \(n\) is large. Numerical results are given.
    0 references
    0 references
    option
    0 references
    pricing
    0 references
    lattice
    0 references
    combinatorics
    0 references
    exotic option
    0 references
    0 references
    0 references