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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.