MARKOV-CHAIN VERSION OF SECRETARY PROBLEM

[1] ALBRIGHT S. C., 1972, MANAGE SCI, V19, P46

[2] ALBRIGHT SC, 1972, THESIS STANFORD U

[3] SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (07): : 349 - 355

[4] A PERSISTENCY PROBLEM CONNECTED WITH A POINT PROCESS [J]. JOURNAL OF APPLIED PROBABILITY, 1967, 4 (01) : 77 - &

[5] RECOGNIZING MAXIMUM OF A SEQUENCE [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1966, 61 (313) : 35 - +

[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

[1] ALBRIGHT S. C., 1972, MANAGE SCI, V19, P46

[2] ALBRIGHT SC, 1972, THESIS STANFORD U

[3] SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (07): : 349 - 355

[4] A PERSISTENCY PROBLEM CONNECTED WITH A POINT PROCESS [J]. JOURNAL OF APPLIED PROBABILITY, 1967, 4 (01) : 77 - &

[5] RECOGNIZING MAXIMUM OF A SEQUENCE [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1966, 61 (313) : 35 - +

[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