AN OPTIMAL STOPPING PROBLEM ON TREE
Hiroshi Hisano · Bulletin of informatics and cybernetics · 2007
This paper deals with an optimal stopping problem where both transition weights and terminal rewards are given on tree with a root. It is shown that the optimal stopping rule can be constructed by backward induction. It is also clarified that there is no need to take into the consideration the condition that not only the terminal rewards but also transition weights should be "positive".