2007
DOI: 10.1016/s0927-0507(07)15022-2
|View full text |Cite
|
Sign up to set email alerts
|

Chapter 22 Duality Theory and Approximate Dynamic Programming for Pricing American Options and Portfolio Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…Non-trivial redeployment costs (S > 0) make diversification path-dependent, precluding the analytical identification of the policy function (Haugh & Kogan, 2007). That issue is resolved with the simulation-based technique of Brandt et al (2005) illustrated in Van Binsbergen and Brandt (2007).…”
Section: Identification Of Corporate Diversification Choicesmentioning
confidence: 99%
See 2 more Smart Citations
“…Non-trivial redeployment costs (S > 0) make diversification path-dependent, precluding the analytical identification of the policy function (Haugh & Kogan, 2007). That issue is resolved with the simulation-based technique of Brandt et al (2005) illustrated in Van Binsbergen and Brandt (2007).…”
Section: Identification Of Corporate Diversification Choicesmentioning
confidence: 99%
“…Rooted in the general principle of dynamic optimality (Bellman, ), the model identifies the sequence of a firm's scope choices. The similarity between such choices and the allocation of wealth across securities by investors (Merton, ) enables the use of the simulation‐based portfolio selection technique of Brandt, Goyal, Santa‐Clara, and Stroud (), that resolves the challenges of the informal analysis and the analytical intractability of scope choices in path‐dependent setting (Haugh & Kogan, ).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Calculation of V 0 O and V 0 K , O is not feasible analytically (Broadie and Detemple, : 1163; Haugh and Kogan, : 926) because redeployment is allowed at any time before T (making O an American Type option) and involves costs. To find V 0 O and V 0 K , O , we use an efficient and popular numerical complement to the specified analytical model — the binomial lattice method of Cox et al () .…”
Section: Formal Model Of Redeployability and Synergymentioning
confidence: 99%
“…The approximate nature of ADP raises the issue of solution quality, and consequently, a need for methods to bound the distance to optimality. The key tools for this purpose are from duality theory, which has been extended into stochastic dynamic settings by for example (Rogers, 2002;Andersen and Broadie, 2004;Haugh et al, 2006;Haugh and Kogan, 2007;Brown et al, 2010;Brown and Smith, 2011).…”
Section: Approximate Dynamic Programmingmentioning
confidence: 99%