MARKOV-CHAIN VERSION OF SECRETARY PROBLEM

被引：10

作者：

ALBRIGHT, SC ^{[1
]}

机构：

[1] INDIANA UNIV,BLOOMINGTON,IN 47401

来源：

关键词：

Compendex;

D O I：

10.1002/nav.3800230114

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

MATHEMATICAL STATISTICS

引用

页码：151 / 159

页数：9

共 9 条

[1]

ALBRIGHT S. C., 1972, MANAGE SCI, V19, P46

[2]

ALBRIGHT SC, 1972, THESIS STANFORD U

[3] SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM [J].

DERMAN, C ;

LIEBERMA.GJ ;

ROSS, SM .

MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (07) :349-355

[4] A PERSISTENCY PROBLEM CONNECTED WITH A POINT PROCESS [J].

ELFVING, G .

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

GILBERT, JP ;

MOSTELLER, F .

[6]

GUESINZADE SM, 1966, THEORY PROBABILITY I, V11, P472

[7]

KARLIN S, 1962, STUDIES APPLIED PROB

[8]

RASMUSSEN WT, 1974, CANDIDATE PROBLEM UN

[9]

RASMUSSEN WT, 1974, GENERALIZED SECRETAR