A combinatorial proof for the secretary problem with multiple choices (Q6428380): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:54, 10 July 2024
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
math.CO
0 references
cs.DM
0 references
cs.IT
0 references
math.IT
0 references
