In this paper, we discuss relations between optimal stopping problems over tree sets and partially ordered sets, prove that there is a 1-1 correspondence between them and so every optimal strategy can be obtained in t...In this paper, we discuss relations between optimal stopping problems over tree sets and partially ordered sets, prove that there is a 1-1 correspondence between them and so every optimal strategy can be obtained in the set of optimal control variables.展开更多
文摘In this paper, we discuss relations between optimal stopping problems over tree sets and partially ordered sets, prove that there is a 1-1 correspondence between them and so every optimal strategy can be obtained in the set of optimal control variables.
