2011/12/24 by Bayraktar, Erhan, Yao, Song
#FOS: Mathematics #Optimization and Control (math.OC) #Probability (math.PR)
paper · doi:10.48550/arxiv.1112.5744
We generalize the results of Fleming and Souganidis (1989) on zero sum stochastic differential games to the case when the controls are unbounded. We do this by proving a dynamic programming principle using a covering argument instead of relying on a discrete approximation (which is used along with a comparison principle by Fleming and Souganidis). Also, in contrast with Fleming and Souganidis, we define our pay-off through a doubly reflected backward stochastic differential equation. The value function (in the degenerate case of a single controller) is closely related to the second order doubly reflected BSDEs.