SECRETARY PROBLEM WITH FINITE MEMORY

被引:20
作者
SMITH, MH [1 ]
DEELY, JJ [1 ]
机构
[1] UNIV CANTERBURY,DEPT MATH,CHRISTCHURCH,NEW ZEALAND
关键词
D O I
10.2307/2285822
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
引用
收藏
页码:357 / 361
页数:5
相关论文
共 6 条
[1]  
Chow Y.S., 1963, Z WAHRSCHEINLICHKEIT, V2, P33, DOI 10.1007/bf00535296
[2]  
DeGroot, 1970, OPTIMAL STAT DECISIO, V82
[3]   RECOGNIZING MAXIMUM OF A SEQUENCE [J].
GILBERT, JP ;
MOSTELLER, F .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1966, 61 (313) :35-+
[4]  
Lindley DV, 1961, APPLIED STATISTICS, V10, P39
[5]   CLASS OF SECRETARY PROBLEMS [J].
MUCCI, AG .
ANNALS OF PROBABILITY, 1973, 1 (03) :417-427
[6]   RECOGNIZING MAXIMUM OF A RANDOM SEQUENCE BASED ON RELATIVE RANK WITH BACKWARD SOLICITATION [J].
YANG, MCK .
JOURNAL OF APPLIED PROBABILITY, 1974, 11 (03) :504-512