Multiple-choice secretary problem
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
Multiple-choice optimal stopping problem
|
| gptkbp:application |
Hiring processes
Online algorithms |
| gptkbp:describedBy |
gptkb:Journal_of_Applied_Probability
|
| gptkbp:field |
gptkb:Optimal_stopping_theory
|
| gptkbp:generalizes |
gptkb:Secretary_problem
|
| gptkbp:hasVariant |
Matroid secretary problem
Weighted multiple-choice secretary problem k-choice secretary problem |
| https://www.w3.org/2000/01/rdf-schema#label |
Multiple-choice secretary problem
|
| gptkbp:involves |
Selecting multiple candidates
|
| gptkbp:parameter |
Number of applicants (n)
Number of choices (k) |
| gptkbp:relatedTo |
gptkb:Secretary_problem
|
| gptkbp:solvedBy |
Dynamic programming
Threshold rule |
| gptkbp:studiedBy |
1984
F. Thomas Bruss |
| gptkbp:studiedIn |
gptkb:Probability_theory
Statistics |
| gptkbp:bfsParent |
gptkb:Secretary_problem
|
| gptkbp:bfsLayer |
8
|