OPTIMAL SELECTION PROBLEM WITH THREE STOPS

  • Ano Katsunori
    Department of Information Systems and Quantitative Sciences, Nanzan University

Search this article

Abstract

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.

Journal

Details 詳細情報について

  • CRID
    1570572701906495488
  • NII Article ID
    110001184291
  • NII Book ID
    AA00703935
  • ISSN
    04534514
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top