Stopping problems with an unknown state
From MaRDI portal
Abstract: We extend the classical setting of an optimal stopping problem under full information to include for problems with an unknown state. The framework allows the unknown state to influence (i) the drift of the underlying process, (ii) the payoff functions, and (iii) the distribution of the time horizon. Since the stopper is assumed to observe the underlying process and the random horizon, this is a two-source learning problem. Assigning a prior distribution for the unknown state, filtering theory can be used to embed the problem in a Markovian framework, and we thus reduce the problem with incomplete information to a problem with complete information but with one more state-variable. We provide a convenient formulation of the reduced problem, based on a measure change technique that decouples the underlying process from the state variable representing the posterior of the unknown state. Moreover, we show by means of several new examples that this reduced formulation can be used to solve problems explicitly.
Recommendations
- Optimal stopping model with unknown transition probabilities
- The problem of optimal stopping in a partially observable Markov chain
- Optimal stopping, randomized stopping, and singular control with general information flow
- Optimal stopping times with different information levels and with time uncertainty
- Optimal stopping under ambiguity in continuous time
This page was built for publication: Stopping problems with an unknown state
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402831)
