| Summary: | 碩士 === 國立清華大學 === 數學系 === 103 === In this thesis, we will introduce the secretary problem and take some extended discussion.
In Chapter 2 we discuss about how to maximize the probability of selecting the best applicant, how to optimize our expect selected applicant’s true rank , and what if applicants to be interviewed sequentially in groups and the manager want to maximize the probability of selecting the best applicant ,like the first question. We use backward induction to find the optimal strategy for each problem.
In chapter 3, we will make some discussion about having a criterion about our applicants, and what if each order of applicants is no longer equally likely.
|
|---|
