Accession Number:

ADA109661

Title:

Optimal Sequential Selection of a Monotone Sequence from a Random Sample.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CA DEPT OF STATISTICS

Report Date:

1981-11-10

Pagination or Media Count:

31.0

Abstract:

The length of the longest monotone increasing subsequence of a random sample of size n is known to have expected value asymptotic to 2nto the 12 power. We prove that it is possible to make sequential choices which give an increasing subsequence of expected length asymptotic to 2nto the 12 power. Moreover, this rate of increase is proved to be asymptotically best possible. Author

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE