An optimal algorithm for stopping on the element closest to the center of an interval

Benevides, 2017, Percolation and best choice problem for powers of paths, J. Appl. Probab., 54, 343, 10.1017/jpr.2017.4 Ferguson, 1989, Who solved the secretary problem?, Stat. Sci., 4, 282 Freij, 2010, Partially ordered secretaries, Electron. Commun. Probab., 115, 504 Georgiou, 2008, On a universal best choice algorithm for partially ordered sets, Random Struct. Algorithms, 32, 263, 10.1002/rsa.20192 Gilbert, 1966, Recognizing the maximum of a sequence, J. Am. Stat. Assoc., 61, 35, 10.1080/01621459.1966.10502008 Goddard, 2013, An efficient algorithm for stopping on a sink in a directed graph, Oper. Res. Lett., 41, 238, 10.1016/j.orl.2013.02.001 Kubicki, 2005, Graph-theoretic generalization of the secretary problem: the directed path case, SIAM J. Discrete Math., 19, 622, 10.1137/S0895480104440596 Lindley, 1961, Dynamic programming and decision theory, Appl. Stat., 10, 39, 10.2307/2985407 Morayne, 1998, Partial-order analogue of the secretary problem; the binary tree case, Discrete Math., 184, 165, 10.1016/S0012-365X(97)00091-5 Preater, 1999, The best-choice problem for partially ordered objects, Oper. Res. Lett., 25, 187, 10.1016/S0167-6377(99)00053-X Rogerson, 1987, Probabilities of choosing applicants of arbitrary rank in the secretary problem, J. Appl. Probab., 224, 527, 10.2307/3214276 Rose, 1982, A problem of optimal choice and assignment, Oper. Res., 30, 172, 10.1287/opre.30.1.172 Stadje, 1980, Efficient stopping of a random series of partially ordered points, Lect. Notes Econ. Math. Syst., 177, 430, 10.1007/978-3-642-48782-8_30 Sulkowska, 2012, The best choice problem for upward directed graphs, Discrete Optim., 9, 200, 10.1016/j.disopt.2012.04.001 Vanderbei