2014
DOI: 10.2139/ssrn.2430558
|View full text |Cite
|
Sign up to set email alerts
|

The Multiplicative Dual for Multiple-Exercise Options

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2015
2015
2016
2016

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
1
0
1
Order By: Relevance
“…From a computational perspective, achieving a sufficiently tight upper bound is equivalent to constructing a "good" martingale, and a tractable algorithm to do so was given by [1]. Upper bound methods have since been extended to the more general class of optimal multiple stopping problems by [19], [26], and [17]. Finally, the paper [25] generalizes this technique to a wider class of discrete-time stochastic control problems.…”
Section: Solution Diagnosticsmentioning
confidence: 99%
“…From a computational perspective, achieving a sufficiently tight upper bound is equivalent to constructing a "good" martingale, and a tractable algorithm to do so was given by [1]. Upper bound methods have since been extended to the more general class of optimal multiple stopping problems by [19], [26], and [17]. Finally, the paper [25] generalizes this technique to a wider class of discrete-time stochastic control problems.…”
Section: Solution Diagnosticsmentioning
confidence: 99%
“…С вычислительной точки зрения, достижение достаточно точных верхних границ эквивалентно построению «хорошего» мартингала, и в [1] был предложен осуществимый алгоритм для этого. Методы построения верхних оценок были впоследствии распространены на более общий класс задач об оптимальной многократной остановке в [19], [26] и [17]. Наконец, работа [25] обобщает эту технику на более широкий класс задач стохастического управления в дискретном времени.…”
Section: )unclassified