Stopping rules and tactics for processes indexed by a directed set

A new notion of tactic for processes indexed by a directed set is introduced. The main theorem, giving conditions under which tactics can be mapped on stopping times on the line, is applied to reduce some optimal stopping problems in the plane to the same problems on the line. In the case of independent random variables, one achieves a nearly complete reduction of the optimal reward problem to the linear case.