Abstract
The classical secretary problem models a situation in which the decision maker can select or reject in the sequential observation objects numbered by the relative ranks. In theoretical studies, it is known that the strategy is to reject the first 37% of objects and select the next relative best one. However, an empirical result for the problem is that people do not apply the optimal rule. In this article, we propose modeling doubts of decision maker by considering a modification of the secretary problem. We assume that the decision maker can not observe the relative ranks in a proper way. We calculate the optimal strategy in such a problem and the value of the problem. In special cases, we also combine this problem with the no-information best choice problem and a no-information second-best choice problem.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献