本論文主旨在於介紹秘書問題以及一些相關的衍生討論。第二章一開始首先介紹了最大化選取到第一名機率、最佳化選取到的候選者排名這兩種不同目標的秘書問題，以及一個目標同樣為最大化選取第一名機率但選取規則稍有不同的分組問題，並針對這三者使用後退歸納法找出他們的最佳策略。

第三章我們從兩個不同的思考角度切入探討其相關的衍生問題，第一個是加入篩選標準之後的衍生討論，第二個則是當候選者們的排序並不完全隨機時的探討。

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.

[1]A.G. Mucci(1973),"On a class of secretary problem.",Ann.Prob. 1,417-427.
[2]Dimitris A. Sardelis and Theodoros M. Valahas(1999),"Decision Making: A Golden Rule",The American Mathematical MonthlyVol. 106, pp. 215-226.
[3]D.V.Lindley(1961),”Dynamic programming and decision theory”Appl.Statistics 10,39-51.
[4]J. Gilbert and F. Mosteller (1966),“Recognizing the maximum of a sequence”, J.Amer. Statist. Assoc. 61, 35-73.
[5]S.M.Gusein-Zade(1966) ,"The problem of choice and the optimal stopping rule for a sequence of independent trials",Theory Prob. Applic. 11,472-476.
[6]S.R.Hsiau and J.R.Yand(2000),”A natural variation of the standard secretary problem”,Statistica Sinica 10,639-646.
[7]S.P Kane(2012), "A new dimension to the secretary problem" ,Theory Prob. Applic. 11,472-476.
[8]T. S. Ferguson (1989),“Who solved the secretary problem?”, Statistical Science 4,282-296.
[9]T. S. Ferguson,“Optimal Stopping and Applications”, http://tinyurl.com/6amvzr5
[10]P. R. Freeman(1999), "The Secretary Problem and Its Extensions: A Review",The American Mathematical MonthlyVol. 106, No. 3, pp. 215-226.
[11]Y. S. Chow, H. Robbins and D. Siegmund (1971),”Great Expectations: The Theory ofOptimal Stopping”,Houghton Mifflin Company, Boston.
[12]Y.S.Chow,S.Moriguti,H.Robbins and S.M.Samuels(1964),“Optimal selections based on relative ranks”,Israel J.Math 2,81-90