Recognizing the Maximum of a Sequence¶
Gilbert, J. P., & Mosteller, F. (1966). Recognizing the Maximum of a Sequence. Journal of the American Statistical Association, 61(313), 35-73.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Secretary-Problem Sampling Rule
- It is the classic secretary problem, whose optimal policy is the sample-then-commit rule with the roughly 37% split.
This sourceDerives the classic secretary problem’s observe-then-select policy with an asymptotic cutoff of about 1/e, or 37 percent.
- It is the classic secretary problem, whose optimal policy is the sample-then-commit rule with the roughly 37% split.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:2502695784c6 · see in the full table