Gusein-Zade problem for directed path

Lindley, 1961, Dynamic programming and decision theory, Applied Statistics, 10, 39, 10.2307/2985407 Ferguson, 1989, Who solved the secretary problem?, Statistical Science, 4, 282, 10.1214/ss/1177012493 Samuels, 1991 Gusein-Zade, 1966, The problem of choice and the optimal stopping rule for a sequence of independent trials, Teoria Verojatnosti i Primenenia, 11, 534 Frank, 1980, On an optimal stopping problem of Gusein-Zade, Stochastic Processes and Their Applications, 10, 299, 10.1016/0304-4149(80)90013-7 Gilbert, 1966, Recognizing the maximum of a sequence, Journal of the American Statistical Association, 61, 35, 10.1080/01621459.1966.10502008 Dynkin, 1969 Stadje, 1979, Efficient stopping of a random series of partially ordered points, vol. 177 Gnedin, 1992, Multicriteria extensions of the best choice problem: Sequential selection without linear order, in: Strategies for sequential search and selection in real time (Amherst, MA, 1990), Contemporary Mathematics, 125, 153, 10.1090/conm/125/1160617 Gnedin, 1994, On the best choice problem with dependent criteria, Journal of Applied Probability, 31, 221, 10.2307/3215248 Morayne, 1998, Partial order analogue of the secretary problem; the binary tree case, Discrete Mathematics, 184, 165, 10.1016/S0012-365X(97)00091-5 Preater, 1999, The best choice problem for partially ordered objects, Operations Research Letters, 25, 187, 10.1016/S0167-6377(99)00053-X Georgiou, 2008, On a universal best choice algorithm for partially ordered sets, Random Structures and Algorithms, 32, 263, 10.1002/rsa.20192 Kubicki, 2005, Graph-theoretic generalization of the secretary problem: the directed path case, SIAM Journal on Discrete Mathematics, 19, 622, 10.1137/S0895480104440596