The Secretary Problem with Interview Cost,

reportActive / Technical Report | Accession Number: AD0785849 | Need Help?

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

Author(s):
Bartoszynski, R. ; Govindarajulu, Z.
Author Organization(s):
KENTUCKY UNIV LEXINGTON DEPT OF STATISTICS
Pagination:
0025

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-71, TR6-ONR
Contract/Grant Number(s):
N00014-73-A-0385-0001
Project Number(s):
NR-042-295
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*Decision theory, Probability, Costs, Permutations
Field(s)/Group(s):
Statistics and Probability
Keyword(s):
*Stopping rules(Mathematics), *Secretary problem, Ranking
Report Date:
1974 Jul 01