An adaptive \(O(\log n)\)-optimal policy for the online selection of a monotone subsequence from a random sample (Q4601440)
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: An adaptive O( n)-optimal policy for the online selection of a monotone subsequence from a random sample |
scientific article; zbMATH DE number 6826550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive \(O(\log n)\)-optimal policy for the online selection of a monotone subsequence from a random sample |
scientific article; zbMATH DE number 6826550 |
Statements
An adaptive <i>O</i>(log <i>n</i>)‐optimal policy for the online selection of a monotone subsequence from a random sample (English)
0 references
16 January 2018
0 references
adaptive policy
0 references
dynamic programming
0 references
Markov decision problem
0 references
monotone subsequence
0 references
online selection
0 references
0.8711583018302917
0 references
0.8256184458732605
0 references
0.8239883780479431
0 references
0.8237436413764954
0 references
0.8107789754867554
0 references
