Statements (31)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
marriage problem
|
| gptkbp:application |
online dating
real estate hiring |
| gptkbp:category |
statistics
decision making mathematical optimization |
| gptkbp:describes |
A problem that aims to maximize the probability of selecting the best candidate when interviewing sequentially.
|
| gptkbp:field |
gptkb:probability_theory
decision theory optimal stopping theory |
| gptkbp:generalizes |
gptkb:full-information_best_choice_problem
multiple-choice secretary problem weighted secretary problem |
| https://www.w3.org/2000/01/rdf-schema#label |
secretary problem
|
| gptkbp:notableContributor |
gptkb:Freeman_Dyson
gptkb:John_Gilbert gptkb:Martin_Gardner gptkb:Lindley,_D._V. |
| gptkbp:origin |
Introduced in the 1950s
|
| gptkbp:probability_of_success |
approximately 37%
|
| gptkbp:relatedConcept |
optimal stopping
best choice problem odds algorithm prophet inequality |
| gptkbp:solvedBy |
1/e stopping rule
Optimal stopping rule Skip the first n/e candidates, then select the next candidate better than all previous ones |
| gptkbp:bfsParent |
gptkb:House-selling_problem
|
| gptkbp:bfsLayer |
8
|