Improved algorithms and analysis for secretary problems and generalizations (Q2706186)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved algorithms and analysis for secretary problems and generalizations |
scientific article; zbMATH DE number 1578819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved algorithms and analysis for secretary problems and generalizations |
scientific article; zbMATH DE number 1578819 |
Statements
19 March 2001
0 references
dynamic programming
0 references
explicit algorithms
0 references
optimal stopping
0 references
expected rank
0 references
maximization
0 references
secretary problems
0 references
Improved algorithms and analysis for secretary problems and generalizations (English)
0 references
A family of explicit algorithms for the secretary problems is developed. A lower bound on the trade-off between the probability of selecting the best object and the expected rank of the selected object are derived too.
0 references
0.8346908092498779
0 references
0.8317171931266785
0 references
0.8304724097251892
0 references
0.8197734355926514
0 references
0.8164963126182556
0 references
