Location of Repository

MINIMAX-OPTIMAL STOP RULES AND DISTRIBUTIONS IN SECRETARY PROBLEMS BY By THEODORE P. HILL1 of Technology of Gdttingen

By Ulrich Krengel

Abstract

For the secretary (or best-choice) problem with an unknown number N of objects, minimax-optimal stop rules and (worst-case) distributions are derived, under the assumption that N is a random variable with unknown distribution, but known upper bound n. Asymptotically, the probability of selecting the best object in this situation is of order of (log 1. For example, even if the only information available is that there are somewhere between 1 and 100 objects, there is still a strategy which will select the best item about one time in five

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.359.4292
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.