FINITE-MEMORY SECRETARY PROBLEM

被引：11

作者：

RUBIN, H ^{[1
]}

SAMUELS, SM ^{[1
]}

机构：

[1] PURDUE UNIV,DEPT STAT,W LAFAYETTE,IN 47907

来源：

ANNALS OF PROBABILITY | 1977年 / 5卷 / 04期

关键词：

D O I：

10.1214/aop/1176995774

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：627 / 635

页数：9

共 9 条

[1]

Chow Y.S., 1971, GREAT EXPECTATIONS T

[2] OPTIMAL SELECTION BASED ON RELATIVE RANK ( SECRETARY PROBLEM ) [J].

CHOW, YS ;

MORIGUTI, S ;

ROBBINS, H ;

SAMUELS, SM .

ISRAEL JOURNAL OF MATHEMATICS, 1964, 2 (02) :81-&

[3]

DYNKIN EB, 1969, MARKOV PROCESSES

[4] INFINITE SECRETARY PROBLEM [J].

GIANINI, J ;

SAMUELS, SM .

ANNALS OF PROBABILITY, 1976, 4 (03) :418-432

[5]

GIANINI J, IN PRESS

[6] RECOGNIZING MAXIMUM OF A SEQUENCE [J].

GILBERT, JP ;

MOSTELLER, F .

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1966, 61 (313) :35-+

[7]

RUBIN H, 1966, ANN MATH STAT, V37, P544

[8] SECRETARY PROBLEM WITH FINITE MEMORY [J].

SMITH, MH ;

DEELY, JJ .

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1975, 70 (350) :357-361

[9] 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

← 1 →