pith. sign in

arxiv: 1501.06449 · v2 · pith:KBU4NY7Unew · submitted 2015-01-26 · 🧮 math.OC

A Brownian optimal switching problem under incomplete information

classification 🧮 math.OC
keywords informationproblemincompletefunctionoptimalvaluebrownianfull
0
0 comments X
read the original abstract

In this paper we study an incomplete information optimal switching problem in which the manager only has access to noisy observations of the underlying Brownian motion $\{W_t\}_{t \geq 0}$. The manager can, at a fixed cost, switch between having the production facility open or closed and must find the optimal management strategy using only the noisy observations. Using the theory of linear stochastic filtering, we reduce the incomplete information problem to a full information problem, show that the value function is non-decreasing with the amount of information available, and that the value function of the incomplete information problem converges to the value function of the corresponding full information problem as the noise in the observed process tends to $0$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.