Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • A generalization of the classical secretary problem: dependent arrival sequences

  • J. H. Reeves, V. F. Flack
  • Journal:
    Journal of Applied Probability / Volume 25 / Issue 1 / March 1988
    Published online by Cambridge University Press:
    14 July 2016, pp. 97-105
    Print publication:
    March 1988

  • This paper presents new methods for selecting the best population value under the classical secretary problem sequential selection rules. Unlike the classical case, the possible population arrival sequences considered here are not necessarily equally likely. When arrival orders in the sequence are rank dependent, the performance of the optimal solution to the standard problem (totally random arrival order assumed) is very poor, compared with procedures designed to guard against non-uniform arrival orders.