109/3/4林奕伸 教授 (江蘇省鹽城師範學院)
A short survey on best-choice problems
Prof. Yi-Shen Lin
School of Mathematics and Statistics, Yancheng Teachers University, Jiangsu
In the classical best-choice problem, a manager of a company wants to hire a secretary and knows that there are n rankable applicants applying sequentially for the job. Upon interviewing an applicant, the manager is only able to observe the applicant’s relative rank among those that have been interviewed so far and must decide either to hire the present applicant or reject the applicant and interview the next one. The stopping time which maximizes the probability of selecting the best of the n applicants is well known to be of threshold type, and the limiting maximum probability is 1/e as n tends to infinity. In this talk, I will first review relevant literature and then present my recent work on best-choice problems.
Keywords: best-choice problem; optimal stopping.
日 期：109年3月4日(星期三) 16:10~17:00