Optimal Stopping Problem with a Vector-Valued Reward Function

In this note, using the well-known method of scalarization, we give an explicit characterization of the Pareto optimal stopping time for a vector-valued optimal stopping problem with only two reward functions. The present problem is a natural generalization of the classical McDonald-Siegel optimal stopping problem.