The secretary problem for a random walk
AbstractThe secretary problem for a random walk is described. A particle has equal probabilities of moving j steps up or j steps down. The optimal strategy of picking the maximum height in n steps without the opportunity of recall is found. The best strategy is shown to be exactly the same as the naive strategy of choosing the first element of the sequence. The theory is extended to symmetric continuous distributions.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Stochastic Processes and their Applications.
Volume (Year): 28 (1988)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Chun, Young Hak, 1997. "Rank-based selection strategies for the random walk process," European Journal of Operational Research, Elsevier, vol. 96(2), pages 417-427, January.
- Hak Chun, Young, 1996. "Selecting the best choice in the weighted secretary problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 135-147, July.
- Pieter C. Allaart, 2009. "A general "bang-bang" principle for predicting the maximum of a random walk," Papers 0910.0545, arXiv.org.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.