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

A satisficing policy of the secretary problem: theory and simulation

Author

Listed:
  • Xinlin Wu
  • Haixiong Li

Abstract

In the standard secretary problem (SP), a decision-maker (DM) tries to choose the best applicant of a sequentially ordered set, and the goal is to maximize the probability of choosing the best applicant. In this paper, we extend the standard SP and present a satisficing policy. There are several satisfactory applicants for the DM to choose under the satisficing policy. The DM cannot rank all the applicants from best to worst due to the limits of the DM’s incomplete preferences, and the goal is to maximize the probability of choosing one of satisfactory applicants. For the secretary problem with 2 and 3 satisfactory applicants respectively, on the one hand, the asymptotic results of the maximum probability of choosing a satisfactory applicant and the corresponding optimal cutoff value are computed respectively. On the other hand, a series of computer simulations are conducted to estimate the optimal cutoff value and the maximum probability of choosing a satisfactory applicant. The effects of incorporating endogenous search cost in the case of 50 and 100 applicants are investigated respectively under the satisficing policy. The satisficing policy of this paper can be regarded as an extension of the optimal policy of the standard SP.

Suggested Citation

  • Xinlin Wu & Haixiong Li, 2022. "A satisficing policy of the secretary problem: theory and simulation," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(18), pages 6151-6165, September.
    • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:18:p:6151-6165
    DOI: 10.1080/03610926.2020.1856875
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1856875
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2020.1856875?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:51:y:2022:i:18:p:6151-6165. 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.