arXiv Analytics

Sign in

arXiv:1202.1930 [math.PR]AbstractReferencesReviewsResources

Dynkin games in a general framework

Magdalena Kobylanski, Marie-Claire Quenez, Marc Roger de Campagnolle

Published 2012-02-09, updated 2013-08-14Version 3

We revisit the Dynkin game problem in a general framework, improve classical results and relax some assumptions. The criterion is expressed in terms of families of random variables indexed by stopping times. We construct two nonnegative supermartingales families $J$ and $J'$ whose finitness is equivalent to the Mokobodski's condition. Under some weak right-regularity assumption, the game is shown to be fair and $J-J'$ is shown to be the common value function. Existence of saddle points is derived under some weak additional assumptions. All the results are written in terms of random variables and are proven by using only classical results of probability theory.

Related articles: Most relevant | Search more
arXiv:1009.3862 [math.PR] (Published 2010-09-20, updated 2013-02-28)
Optimal stopping in a general framework
arXiv:math/0610515 [math.PR] (Published 2006-10-17)
A note on the invariance principle of the product of sums of random variables
arXiv:math/0505692 [math.PR] (Published 2005-05-31)
Rank Independence and Rearrangements of Random Variables