Proceedings of the 2011 American Control Conference 2011
DOI: 10.1109/acc.2011.5991205
|View full text |Cite
|
Sign up to set email alerts
|

A stochastic model predictive control approach to dynamic option hedging with transaction costs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 20 publications
(14 citation statements)
references
References 14 publications
0
14
0
Order By: Relevance
“…We test the 3 SMPC formulations for dynamic hedging defined, respectively, by Equations , 25, and 26 on a European plain vanilla call option and a barrier option with scenarios of stock and option prices generated according to Section 4. For the QP‐Var approach, we select α=0.25, as it was calibrated in the works of Bemporad et al using simulations of a lognormal stock model and assuming real market generating prices according to the same model (idealized nominal case). For the LP‐CVaR approach, we use β=95% in Equation 25.…”
Section: Hedging Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We test the 3 SMPC formulations for dynamic hedging defined, respectively, by Equations , 25, and 26 on a European plain vanilla call option and a barrier option with scenarios of stock and option prices generated according to Section 4. For the QP‐Var approach, we select α=0.25, as it was calibrated in the works of Bemporad et al using simulations of a lognormal stock model and assuming real market generating prices according to the same model (idealized nominal case). For the LP‐CVaR approach, we use β=95% in Equation 25.…”
Section: Hedging Resultsmentioning
confidence: 99%
“…We consider different performance measures (a trade‐off between variance and expected value of hedging error, conditional value at risk (CVaR), and the largest predicted hedging error) and show how the corresponding optimization problems can be easily solved via either quadratic or linear programming. A preliminary version of this work was presented in the conference paper of Bemporad et al, which we largely extend here by considering real‐world data in our results drawn from the NASDAQ‐100 composite and by proposing suitable scenario generation schemes to construct the stochastic optimization problems.…”
Section: Introductionmentioning
confidence: 89%
“…Let v j = max y j − r − α, 0 , the scenario-based SMPC problem can be redefined using the CVaR performance index [46]:…”
Section: Minimization Of Conditional Value At Risk (Lp-cvar)mentioning
confidence: 99%
“…Theoretical advances are being made in a number of fields. Model Predictive Control (MPC) with stochastic weight models can be used [18] (most stochastic MPC approaches will consider only stochastic limits, not weights). On the other hand dynamic programming (usually involving quantization) and mixed integer algorithms can help to find the expected cost benefit of charging at specific times [19].…”
Section: Stochastic Pricesmentioning
confidence: 99%