IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2025i14p4274-4282.html
   My bibliography  Save this article

A note on the satisficing policy of the secretary problem

Author

Listed:
  • Gaofeng Zhou
  • Xinlin Wu

Abstract

Wu and Li (2022) presented a satisficing policy for the secretary problem (SP). Moreover, Wu and Li (2022) derived asymptotic formulas of the maximum probability of choosing one of the k satisfactory applicants with special cases k = 2 and 3, respectively, in the satisficing policy. “Based on the work of Wu and Li (2022), this paper derives the asymptotic formulas for the probability of selecting one of the k satisfactory applicants and provides the equation for the approximate optimal cutoff value to achieve the asymptotic maximum probability in the general case of k satisfactory applicants under the satisficing policy.” Moreover, a series of computer simulations are conducted to test the theoretical results for k = 4 and 5.

Suggested Citation

  • Gaofeng Zhou & Xinlin Wu, 2025. "A note on the satisficing policy of the secretary problem," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(14), pages 4274-4282, July.
    • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:14:p:4274-4282
    DOI: 10.1080/03610926.2024.2417817
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2417817
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2024.2417817?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:54:y:2025:i:14:p:4274-4282. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.