Iterated full information secretary problem
M Kuchta - Mathematical Methods of Operations Research, 2017 - Springer
M Kuchta
Mathematical Methods of Operations Research, 2017•Springer… We consider a full information best-choice problem where an administrator who has only
one on-line choice in m consecutive searches has to choose the best candidate in one of
them. … In this paper we consider a modification to the classical full information best-choice
problem. Namely, we consider m consecutive classical full information searches. Our aim is
to choose the largest element in one of them if we have only one choice. Our goal is to find
a strategy that maximizes the probability of achieving this aim. …
one on-line choice in m consecutive searches has to choose the best candidate in one of
them. … In this paper we consider a modification to the classical full information best-choice
problem. Namely, we consider m consecutive classical full information searches. Our aim is
to choose the largest element in one of them if we have only one choice. Our goal is to find
a strategy that maximizes the probability of achieving this aim. …
Abstract
We consider a full information best-choice problem where an administrator who has only one on-line choice in m consecutive searches has to choose the best candidate in one of them.
Springer
Showing the best result for this search. See all results