Abstract
n i.i.d. random variables with known continuous distribution are observed sequentially with the objective of selecting the largest. This paper considers the finite-memory case which, at each stage, allows a solicitation of anyone of the last m observations as well as of the present one. If the (k – t)th observation with value x is solicited at the k th stage, the probability of successful solicitation is p1(x) or p2(x) according to whether t = 0 or 1 ≦ t ≦ m. The optimal procedure is shown to be characterized by the double sequences of decision numbers. A simple algorithm for calculating the decision numbers and the probability of selecting the largest is obtained in a special case.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference6 articles.
1. Samuels S. M. (1981) An explicit formula for the limiting optimal success probability in the full information best choice problem. Purdue University Statistics Department Mimeograph Series.
2. A note on the dowry problem;Sakaguchi;Rep. Statist. Appl. Res. JUSE,1973
3. A Secretary Problem with Finite Memory
4. Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation
5. The Finite-Memory Secretary Problem
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献