A Secretary Problem with a Random Number of Choices.

Abstract

In this paper, the best-choice secretary Problem is modified to allow the player to make more than one choice. The probability of selecting the best object is computed. The optimal starting time is characterized, and expressions are derived for the expected number of objects chosen and the expected number of objects sampled by this procedure. Asymptotic results are also derived. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1979
Accession Number
ADA068186

Entities

People

  • Kenneth S. Glasser

Organizations

  • Center for Naval Analyses

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Applied Mathematics
  • Equations
  • Information Processing
  • Information Science
  • Integrals
  • Manpower
  • Mathematical Analysis
  • Mathematics
  • New York
  • Operations Research
  • Physics
  • Political Science
  • Probability
  • Random Variables
  • Statistics
  • Theorems
  • Virginia

Fields of Study

  • Mathematics

Readers

  • Database Systems and Applications
  • Defense Technology Research and Development.
  • Statistical inference.