A full-information best-choice problem with finite memory (Q3753199)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3990520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A full-information best-choice problem with finite memory |
scientific article; zbMATH DE number 3990520 |
Statements
A full-information best-choice problem with finite memory (English)
0 references
1986
0 references
secretary problem
0 references
full information
0 references
finite memory
0 references
optimal stopping time
0 references
0.83505434
0 references
0.8276831
0 references
0.8251403
0 references
0.8227544
0 references
