Quickest Online Selection of an Increasing Subsequence of Specified Size

Loading...
Thumbnail Image
Penn collection
Finance Papers
Degree type
Discipline
Subject
Business
Finance and Financial Management
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Arlotto, Alessandro
Mossel, Elchanan
Steele, J. Michael
Contributor
Abstract

Given a sequence of independent random variables with a common continuous distribution, we consider the online decision problem where one seeks to minimize the expected value of the time that is needed to complete the selection of a monotone increasing subsequence of a prespecified length n. This problem is dual to some online decision problems that have been considered earlier, and this dual problem has some notable advantages. In particular, the recursions and equations of optimality lead with relative ease to asymptotic formulas for mean and variance of the minimal selection time.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2016-09-01
Journal title
Random Structures & Algorithms
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection