Premium
Optimal Selection Strategy for the Group Interview Problem
Author(s) -
Chun Young Hak,
Moskowitz Herbert,
Plante Robert D.
Publication year - 1993
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1993.tb00476.x
Subject(s) - mathematical optimization , selection (genetic algorithm) , heuristic , sequence (biology) , computer science , group (periodic table) , monte carlo method , secretary problem , process (computing) , group selection , mathematics , optimal stopping , artificial intelligence , statistics , chemistry , organic chemistry , biology , genetics , operating system
We propose a more generalized version of the secretary problem, called the group interview problem, in which each group contains several alternatives and each group of alternatives is presented and evaluated sequentially over time. Using the assumptions corresponding to the classical secretary problem, we derive an optimal selection strategy which maximizes the probability of winning or selecting the single best choice in a given sequence of groups. We further address the problem of choosing at the beginning of the evaluation process a sequence of groups to maximize the winning probability. Because of formidable computational requirements to obtain an optimal solution to this sequencing problem, we then develop a heuristic algorithm based on several properties inherent in an optimal selection strategy. The heuristic procedure is evaluated experimentally using Monte Carlo simulation and is shown to be effective in obtaining near‐optimal (within 5 percent) solutions.