The Secretary Problem with Interview Cost,

Abstract

The paper deals with the so-called secretary problem, i.e. with the problem of optimal stopping of the random permutation (x sub 1),...,x sub n of numbers 1,...,n, when the admissible information at each stage is only the relative value of the element observed last with respect to the preceding ones. (Modified author abstract)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1974
Accession Number
AD0785849

Entities

People

  • R. Bartoszynski
  • Z. Govindarajulu

Organizations

  • University of Kentucky

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Permutations

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Government Contracting/Procurement.
  • Graph Algorithms and Convex Optimization.