Optimal online selection of a monotone subsequence: a central limit theorem (Q491928)
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: Optimal online selection of a monotone subsequence: a central limit theorem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal online selection of a monotone subsequence: a central limit theorem |
scientific article |
Statements
Optimal online selection of a monotone subsequence: a central limit theorem (English)
0 references
19 August 2015
0 references
optimal online selection
0 references
monotone subsequence
0 references
central limit theorem
0 references
martingale
0 references
Bellman equation
0 references
Markov decision problem
0 references
dynamic programming
0 references
non-homogeneous Markov chain
0 references
0 references
0 references
0 references
0 references
0.8907843828201294
0 references
0.8872897028923035
0 references
0.8830106854438782
0 references
0.8711583018302917
0 references
