Abstract
We present an extension of the secretary problem in which the decision maker (DM) sequentially observes up to n applicants whose values are random variables X 1 , X 2 , … , X n drawn i.i.d. from a uniform distribution on [ 0 , 1 ] . The DM must select exactly one applicant, cannot recall released applicants, and receives a payoff of x t , the realization of X t , for selecting the tth applicant. For each encountered applicant, the DM only learns whether the applicant is the best so far. We prove that the optimal policy dictates skipping the first sqrt( n )-1 applicants, and then selecting the next encountered applicant whose value is a maximum.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
