arXiv Analytics

Sign in

arXiv:1802.06347 [math.OC]AbstractReferencesReviewsResources

Optimal stopping, randomized stopping and singular control with partial information flow

Nacira Agram, Sven Haadem, Bernt Oksendal, Frank Proske

Published 2018-02-18Version 1

The purpose of this paper is two-fold: We extend the well-known relation between optimal stopping and randomized stopping of a given stochastic process to a situation where the available information flow is a sub-filtration of the filtration of the process. We call these problems optimal stopping and randomized stopping with partial information. Following an idea of Krylov [K] we introduce a special singular stochastic control problem with partial information and show that this is also equivalent to the partial information optimal stopping and randomized stopping problems. Then we show that the solution of this singular control problem can be expressed in terms of (partial information) variational inequalities, which in turn can be rewritten as a reflected backward stochastic differential equation (RBSDE) with partial information.

Related articles: Most relevant | Search more
arXiv:1712.02164 [math.OC] (Published 2017-12-06)
On the Singular Control of Exchange Rates
arXiv:1601.05709 [math.OC] (Published 2016-01-21)
Stochastic nonzero-sum games: a new connection between singular control and optimal stopping
arXiv:1802.05527 [math.OC] (Published 2018-02-15)
Singular control and optimal stopping of memory mean-field processes