Skip to main content
Article
Minimax-Optimal Strategies for the Best-Choice Problem When a Bound is Known for the Expected Number of Objects
SIAM Journal of Control and Optimization
  • Theodore P. Hill, Georgia Institute of Technology - Main Campus
  • D. P. Kennedy, University of Cambridge
Publication Date
7-1-1994
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
Citation Information
Theodore P. Hill and D. P. Kennedy. "Minimax-Optimal Strategies for the Best-Choice Problem When a Bound is Known for the Expected Number of Objects" SIAM Journal of Control and Optimization Vol. 32 Iss. 4 (1994) p. 937 - 951
Available at: http://works.bepress.com/tphill/13/