The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy (Q2074989)
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: The best choice problem with random arrivals: how to beat the 1 / e-strategy |
scientific article; zbMATH DE number 7472523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy |
scientific article; zbMATH DE number 7472523 |
Statements
The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy (English)
0 references
11 February 2022
0 references
best choice problem
0 references
optimal stopping
0 references
random arrivals
0 references
\( 1 / e\)-strategy
0 references
minimax strategy
0 references
dominance
0 references
0 references
0 references
0 references
0 references
0 references
0.8363183736801147
0 references
0.8357575535774231
0 references
0.831976592540741
0 references
0.8072302937507629
0 references
