%0 Journal Article
%T Sequential Selection of a Monotone Subsequence from a Random Permutation
%A Peichao Peng
%A J. Michael Steele
%J Mathematics
%D 2015
%I arXiv
%X We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of optimal selection from a random permutation is quantifiably larger than optimal sequential selection from an independent sequences of uniformly distributed random variables; specifically, it is larger by at least (1/6)log n +O(1).
%U http://arxiv.org/abs/1509.04617v1