OPTIMAL SELECTION OF THE <i>k</i>-TH BEST CANDIDATE (Q5056626): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5641856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who solved the secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Secretary Problem and Its Extensions: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem of Optimal Choice and Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection of nonextremal candidates from a random sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326663 / rank
 
Normal rank

Latest revision as of 01:08, 31 July 2024

scientific article; zbMATH DE number 7629467
Language Label Description Also known as
English
OPTIMAL SELECTION OF THE <i>k</i>-TH BEST CANDIDATE
scientific article; zbMATH DE number 7629467

    Statements

    OPTIMAL SELECTION OF THE <i>k</i>-TH BEST CANDIDATE (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2022
    0 references
    backward induction
    0 references
    best choice
    0 references
    optimal stopping
    0 references
    secretary problem
    0 references

    Identifiers