Contents
Preface
GENERALIZATIONS OF THE CLASSICAL SECRETARY
PROBLEM
Optimal Selection, Learning and Machine Implementation
F. THOMAS BRUSS
Maximizing the Duration of Owning a Relatively Best Object
T.
s.
FERGUSON,
J.
P. HARDWICK, AND M. TAMAKI
On a Best Choice Problem Related to the Poisson Process
ALEXANDER
V.
GNEDIN AND MINORU SAKAGUCHI
The Secretary Problem: Optimal Selection from Two Streams of
Candidates
z.
GOVINDARAJULU
On the Game of Googol as the Secretary Problem
STEPHEN SILVERMAN AND ARTHUR NADAS
SEQUENTIAL SCHEDULING, SEARCH, AND BANDIT
PROBLEMS
A Markov Decision Model of a Search Process
EUGENE A. FEINBERG
Properties of Optimal Strategies in the Poisson Version of the Two-
armed Bandit Problem with Two Hypotheses
E.
L.
PRESMAN
Multiprocessor Scheduling and the Sequential Assignment Problem
RHONDA RIGHTER
v
Vll
3
37
59
65
77
87
97
105
Previous Page Next Page