The explicit solution to a sequential switching problem with non-smooth data

We consider the problem faced by a decision maker who can switch between two random payoff flows. Each of these payoff flows is an additive functional of a general 1D Itô diffusion. There are no bounds on the number or on the frequency of the times at which the decision maker can switch, but each switching incurs a cost, which may depend on the underlying diffusion. The objective of the decision maker is to select a sequence of switching times that maximizes the associated expected discounted payoff flow. In this context, we develop and study a model in the presence of assumptions that involve minimal smoothness requirements from the running payoff and switching cost functions, but which guarantee that the optimal strategies have relatively simple forms. In particular, we derive a complete and explicit characterization of the decision maker's optimal tactics, which can take qualitatively different forms, depending on the problem data. © 2010 Taylor & Francis.