Refined Asymptotics in the Online Selection of an Increasing Subsequence
From MaRDI portal
Abstract: Let be the maximum expected length of an increasing subsequence, which can be selected by an online nonanticipating policy from a random sample of size . Refining known estimates, we obtain an asymptotic expansion of up to a term. The method we use is based on detailed analysis of the dynamic programming equation, and is also applicable to the online selection problem with observations occurring at times of a Poisson process.
This page was built for publication: Refined Asymptotics in the Online Selection of an Increasing Subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6305580)
