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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Q4794126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pricing of Options and Corporate Liabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate option pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Option pricing: A simplified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4905685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRICING AND HEDGING DOUBLE‐BARRIER OPTIONS: A PROBABILISTIC APPROACH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing Options With Curved Boundaries<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903764 / rank
 
Normal rank

Latest revision as of 08:23, 28 June 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
    option
    0 references
    pricing
    0 references
    lattice
    0 references
    combinatorics
    0 references
    exotic option
    0 references
    0 references

    Identifiers