Abstract

For the best-choice (or secretary) problem with an unknown number N of objects, minimax-optimal strategies for the observer and minimax distributions for N are derived under the assumption that N is a random variable with expected value at most M, where M is known. The solution is derived as a special case of the situation where N is constrained by Ef(N)M, where f is increasing with f(i)-f(i-1) convex.

Disciplines

Mathematics

Included in

Mathematics Commons

Share

COinS
 

URL: http://digitalcommons.calpoly.edu/rgp_rsr/31