Stochastic target games with controlled loss
We study a stochastic game where one player tries to find a strategy such that the state process reaches a target of controlled-loss-type, no matter which action is chosen by the other player. We provide, in a general setup, a relaxed geometric dynamic programming principle for this problem and derive, for the case of a controlled SDE, the corresponding dynamic programming equation in the sense of viscosity solutions. As an example, we consider a problem of partial hedging under Knightian uncertainty.
|Date of creation:||Jun 2012|
|Date of revision:||Apr 2014|
|Publication status:||Published in Annals of Applied Probability 2014, Vol. 24, No. 3, 899-934|
|Contact details of provider:|| Web page: http://arxiv.org/|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hans FÃllmer & Peter Leukert, 1999. "Quantile hedging," Finance and Stochastics, Springer, vol. 3(3), pages 251-273.
- Bruno Bouchard & Marcel Nutz, 2011. "Weak Dynamic Programming for Generalized State Constraints," Papers 1105.0745, arXiv.org, revised Oct 2012.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1206.6325. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
If references are entirely missing, you can add them using this form.