OPTIMAL SEQUENTIAL SELECTION BASED ON RELATIVE RANKS WITH RENEWABLE CALL OPTIONS

被引：4

作者：

ROSE, JS

机构：

来源：

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION | 1984年 / 79卷 / 386期

关键词：

D O I：

10.2307/2288286

中图分类号：

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

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：430 / 435

页数：6

共 9 条

[1] THE SECRETARY PROBLEM AS A MODEL OF CHOICE [J].

CORBIN, RM .

JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1980, 21 (01) :1-29

[2]

DeGroot, 1970, OPTIMAL STAT DECISIO, V82

[3] OPTIMAL SELECTION FROM A FINITE SEQUENCE WITH SAMPLING COST [J].

DHARIYAL, ID ;

DUDEWICZ, EJ .

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1981, 76 (376) :952-959

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

GILBERT, JP ;

MOSTELLER, F .

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

[5] OPTIMAL STOPPING WITH SAMPLING COST - THE SECRETARY PROBLEM [J].

LORENZEN, TJ .

ANNALS OF PROBABILITY, 1981, 9 (01) :167-172

[6] BEST-CHOICE PROBLEMS INVOLVING UNCERTAINTY OF SELECTION AND RECALL OF OBSERVATIONS [J].

PETRUCCELLI, JD .

JOURNAL OF APPLIED PROBABILITY, 1981, 18 (02) :415-425

[7] CHOOSING MAXIMUM FROM A SEQUENCE WITH A DISCOUNT FUNCTION [J].

RASMUSSEN, WT ;

PLISKA, SR .

APPLIED MATHEMATICS AND OPTIMIZATION, 1976, 2 (03) :279-289

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

RUBIN, H ;

SAMUELS, SM .

ANNALS OF PROBABILITY, 1977, 5 (04) :627-635

[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 →