Problemintro
Secretary problem
Also called marriage problem, optimal stopping of candidates, optimal stopping problem.
Choose the best of n candidates seen in random order with no recall; the optimal success probability tends to 1/e.
Choose the best of n candidates seen in random order with no recall; the optimal success probability tends to 1/e.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 6MXGD3 Edit this page History Report an error