A combinatorial proof for the secretary problem with multiple choices (Q6428380)

From MaRDI portal
Revision as of 23:22, 25 June 2024 by ArxivImporter (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 900582434
Language Label Description Also known as
English
A combinatorial proof for the secretary problem with multiple choices
scientific article; zbMATH DE number 900582434

    Statements

    4 March 2023
    0 references
    0 references
    math.CO
    0 references
    cs.DM
    0 references
    cs.IT
    0 references
    math.IT
    0 references
    0 references
    0 references
    0 references