Selecting the best choice in the full information group interview problem

Document Type

Article

Publication Date

12-16-1999

Abstract

We consider the problem of selecting the single best choice when several groups of choices are presented sequentially for evaluation. In the so-called group interview problem, we assume that the values of choices are random observations from a known distribution function and derive the optimal search strategy that maximizes the probability of selecting the best among all choices. Under the optimal search strategy derived by means of a dynamic programming technique, a decision maker simply selects the best choice in the group under consideration if its value is higher than the pre-specified decision value for that group. We also consider the optimal ordering strategy for the case where the decision maker is permitted to rearrange the sequence of groups for evaluation. We show that the optimal search and ordering strategies can be applied to many sequential decision problems such as the store location problem.

Publication Source (Journal or Book title)

European Journal of Operational Research

First Page

635

Last Page

651

This document is currently not available here.

Share

COinS