2000 character limit reached
Stochastic target games with controlled loss
Published 27 Jun 2012 in math.OC, math.PR, and q-fin.PR | (1206.6325v3)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.