OPTIMAL SELECTION PROBLEM WITH THREE STOPS

スポンサーリンク

概要

• 論文の詳細を見る

• Optimal selection problem with multiple choices, like secretary, dowry or marriage problems have attracted attention of many applied mathematicians and are also of great significance for those who are looking for "the best partner" . In this paper we consider a variation of the optimal selection problem with three stops allowed which is often referred to as the secretary problem with multiple choices where the objective is to find an optimal stopping rule so as to maximize the probability of selecting three absolute bests. We also present a set of dynamic programming equations for the problems both of selecting the best object with three stops and of selecting two absolute bests with three stops. For those problems the optimal stopping rules are numerically calculated in aid of computer programming.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Ano Katsunori

  Department Of Information Systems And Quantitative Sciences Nanzan University

• Ano Katsunori

  Department Of Information Systems & Quantitative Sciences Nanzan University

関連論文

• A secretary problem with uncertain employment and restricted offering chances
• A SECRETARY PROBLEM WITH UNCERTAIN EMPLOYMENT WHEN THE NUMBER OF OFFERS IS RESTRICTED
• MULTIPLE SELECTION PROBLEM AND OLA STOPPING RULE
• A POISSON ARRIVAL SELECTION PROBLEM FOR GAMMA PRIOR INTENSITY WITH NATURAL NUMBER PARAMETER
• OPTIMAL SELECTION PROBLEM WITH THREE STOPS

スポンサーリンク