paper

Optimal On-Line Selection of an Alternating Subsequence: A Central Limit Theorem

arXiv:1212.1379 · doi:10.1017/S0001867800007205

Abstract

We analyze the optimal policy for the sequential selection of an alternating subsequence from a sequence of independent observations from a continuous distribution , and we prove a central limit theorem for the number of selections made by that policy. The proof exploits the backward recursion of dynamic programming and assembles a detailed understanding of the associated value functions and selection rules.

arXiv comment24 pages, 1 figure

References in corpus (1)

Cited by in corpus (1)