Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
Generalized secretary problem
|
| gptkbp:application |
Hiring processes
Online algorithms |
| gptkbp:describes |
A variant of the secretary problem where each candidate has a weight and the goal is to maximize the expected weight of the selected candidate.
|
| gptkbp:field |
gptkb:Mathematics
gptkb:Probability_theory gptkb:Optimal_stopping_theory |
| gptkbp:hasVariant |
gptkb:Multiple-choice_secretary_problem
Matroid secretary problem |
| https://www.w3.org/2000/01/rdf-schema#label |
Weighted secretary problem
|
| gptkbp:relatedTo |
gptkb:Secretary_problem
|
| gptkbp:solvedBy |
Dynamic programming
Threshold rule |
| gptkbp:studiedBy |
1989
Ferguson, Thomas S. |
| gptkbp:studiedIn |
Operations research
|
| gptkbp:bfsParent |
gptkb:Secretary_problem
|
| gptkbp:bfsLayer |
8
|