A note on the satisficing policy of the secretary problem

Gaofeng Zhou and Xinlin Wu

Communications in Statistics - Theory and Methods, 2025, vol. 54, issue 14, 4274-4282

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.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2024.2417817 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:54:y:2025:i:14:p:4274-4282

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2024.2417817

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().