Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation

Abstract

n i.i.d. random variables with known continuous distribution function F are observed sequentially with the object of choosing the largest. After any observation, say the kth, the observer may solicit any of the first k observations. If the (k – t)th is solicited, the probability of a successful solicitation may depend on t, the number of observations since the (k – t)th, and on the quantile of the (k – t)th observation. General properties of optimal selection procedures are obtained and the optimal procedures and their probabilities of success are derived in some special cases.