This item is non-discoverable
Pricing American options via multi-level approximation methods
dc.contributor.author | Belomestny, Denis | |
dc.contributor.author | Dickmann, Fabian | |
dc.contributor.author | Nagapetyan, Tigran | |
dc.date.accessioned | 2016-06-14T17:44:25Z | |
dc.date.available | 2019-06-28T08:09:55Z | |
dc.date.issued | 2013 | |
dc.description.abstract | In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American or Bermudan options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation, we propose a multi-level low biased estimate for the price of the option. It turns out that the resulting complexity gain can be of order epsilon -1 with epsilon denoting the desired precision. The performance of the proposed multilevel algorithms is illustrated by a numerical example. | |
dc.description.version | publishedVersion | eng |
dc.identifier.uri | https://oa.tib.eu/renate/handle/123456789/2687 | |
dc.language.iso | eng | eng |
dc.publisher | Cambridge : arXiv | |
dc.relation.uri | http://arxiv.org/abs/1303.1334 | |
dc.rights.license | Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden. | ger |
dc.rights.license | This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties. | eng |
dc.subject.ddc | 510 | |
dc.subject.other | Computational Finance (q-fin.CP) | eng |
dc.title | Pricing American options via multi-level approximation methods | |
dc.type | Report | eng |
dc.type | Text | eng |
tib.accessRights | openAccess | eng |
wgl.contributor | WIAS | eng |
wgl.subject | Mathematik | eng |
wgl.type | Report / Forschungsbericht / Arbeitspapier | eng |