Before revision: We consider an optimal stopping problem of a d-dimensional Brownian motion, where the payoff at stopping is the maximum component of the Brownian motion, and there is a running cost before stopping.
After revision: We consider an optimal stopping problem of a decision-maker searching for information on multiple alternatives when information is learned on all alternatives simultaneously. The decision-maker has a running cost before stopping.