On the Candidate Problem with a Random Number of Candidates.

Abstract

In the problem under consideration a decision maker has a total of M candidates to interview sequentially. The decision maker must either accept or reject the candidate being interviewed after he has been ranked with respect to his predecessors. Once rejected a candidate cannot be reconsidered; once a candidate is accepted no futher interviews are carried out. The objective is to select the candidate in such a way as to maximize the probability of choosing the best of all M candidates (assuming every ordering of interviews is equally likely). In this paper we allow M to be a random variable and determine sufficient conditions on its distribution so as to obtain an optimal policy of simple form. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1979
Accession Number
ADA074015

Entities

People

  • Cyrus Derman
  • Gerald J. Lieberman
  • Sheldon M. Ross

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Counter IED

DTIC Thesaurus Topics

  • Air Force
  • California
  • Civil Engineering
  • Engineering
  • Industrial Engineering
  • Mathematics
  • Military Research
  • Operations Research
  • Probability
  • Scientific Research
  • United States
  • United States Government
  • Universities

Readers

  • Military Leadership and Professional Education.
  • Regression Analysis.