[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/huj/dispap/dp668.html
   My bibliography  Save this paper

A generalized secretary problem

Author

Listed:
  • Abba M. Krieger
  • Ester Samuel-Cahn
Abstract
A new Secretary Problem is considered, where for fixed k and m one wins if at some time i = m(j .. 1) + 1 up to jm one selects one of the j best items among the first jm items, j = 1,...,k. Selection is based on relative ranks only. Interest lies in small k values, such as k = 2 or 3. This is compared with the classical rule, where one wins if one of the k best among the n = km items is chosen. We prove that the win probability in the new formulation is always larger than in the classical one. We also show, for k = 2 and 3 that one stops sooner in the new formulation. Numerical comparisons are included.

Suggested Citation

  • Abba M. Krieger & Ester Samuel-Cahn, 2014. "A generalized secretary problem," Discussion Paper Series dp668, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    • Handle: RePEc:huj:dispap:dp668
    as

    Download full text from publisher

    File URL: http://ratio.huji.ac.il/sites/default/files/publications/dp668.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Frank, Arthur Q. & Samuels, Stephen M., 1980. "On an optimal stopping problem of Gusein-Zade," Stochastic Processes and their Applications, Elsevier, vol. 10(3), pages 299-311, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
    2. Adam Woryna, 2017. "The solution of a generalized secretary problem via analytic expressions," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1469-1491, May.
    3. Porosinski, Zdzislaw, 2003. "On optimal choosing of one of the k best objects," Statistics & Probability Letters, Elsevier, vol. 65(4), pages 419-432, December.
    4. Chris Dietz & Dinard van der Laan & Ad Ridder, 2010. "Approximate Results for a Generalized Secretary Problem," Tinbergen Institute Discussion Papers 10-092/4, Tinbergen Institute.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp668. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Michael Simkin (email available below). General contact details of provider: https://edirc.repec.org/data/crihuil.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.