|
gptkbp:instanceOf
|
gptkb:mathematical_concept
gptkb:Optimal_stopping_problem
|
|
gptkbp:alsoKnownAs
|
Marriage problem
|
|
gptkbp:application
|
Hiring processes
Online algorithms
Real-life decision making
|
|
gptkbp:assumes
|
Candidates are interviewed in random order
Decision is irrevocable
Relative ranks are known, not absolute values
|
|
gptkbp:category
|
mathematical optimization
Mathematical puzzles
|
|
gptkbp:describes
|
Optimal stopping rule for sequential selection
|
|
gptkbp:field
|
gptkb:Probability_theory
Statistics
Decision theory
|
|
gptkbp:formed
|
1950s
|
|
gptkbp:generalizes
|
gptkb:Multiple-choice_secretary_problem
gptkb:Weighted_secretary_problem
Unknown number of candidates
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Secretary problem
|
|
gptkbp:notableContributor
|
gptkb:Fred_Mosteller
gptkb:Martin_Gardner
gptkb:John_M._Gilbert
gptkb:Lindley,_D._V.
|
|
gptkbp:notablePublication
|
gptkb:Mathematical_Gazette,_1960
gptkb:Scientific_American,_1960
|
|
gptkbp:relatedTo
|
gptkb:Optimal_stopping_theory
gptkb:Prophet_inequality
Best choice problem
|
|
gptkbp:solutionProbability
|
1/e
|
|
gptkbp:solvedBy
|
Stop at the first candidate who is better than all previous ones after rejecting the first n/e candidates
|
|
gptkbp:bfsParent
|
gptkb:Optimal_Stopping_Rules
|
|
gptkbp:bfsLayer
|
7
|