Solving optimal stopping problems with statistical algorithms
Enough Is Enough
 
        		    		When is it statistically favorable to conclude, say, the search for a suitable employee with a chosen one? Solid algorithms point the way to success.
The saying goes that you should quit when you're ahead. Making a decision on when to conclude a selection process is often not that easy in real life. In mathematical statistics, a puzzle known as the "secretary problem" [1] sums this up nicely. A number of candidates are applying for a secretary position at a company. In the selection process, the employer must decide after each interview, whether to accept the candidate or reject them and hope for a more suitable applicant later on. The decision is final, the employer is not allowed to invite back any rejected applicants.
An employer who is thinking logically should carefully check the first few candidates and not simply take the first one. Later, when the line starts to come to an end, the employer will possibly take on a more-or-less suitable candidate for fear of being left with only unsuitable candidates, and – not having any other options – grudgingly just bite the bullet, and grab whoever is left.
Ideal: 37 Percent
How should the employer proceed to mathematically ensure the best possible odds of finding an above-average candidate? How long should the try-before-buy phase last, in which the employer explores the unknown capabilities of candidates before immediately snapping up the one that is better than all the previous ones and hopefully scores favorably against future candidates further down the line? Mathematicians have been tackling stop problems [2] for thousands of years.
[...]
Buy this article as PDF
(incl. VAT)
Buy Linux Magazine
Subscribe to our Linux Newsletters
Find Linux and Open Source Jobs
Subscribe to our ADMIN Newsletters
    Support Our Work
Linux Magazine content is made possible with support from readers like you. Please consider contributing when you’ve found an article to be beneficial.
 
	
News
- 
		    					    		    Fedora 43 Has Finally LandedThe Fedora Linux developers have announced their latest release, Fedora 43. 
- 
		    					    		    KDE Unleashes Plasma 6.5The Plasma 6.5 desktop environment is now available with new features, improvements, and the usual bug fixes. 
- 
		    					    		    Xubuntu Site Possibly HackedIt appears that the Xubuntu site was hacked and briefly served up a malicious ZIP file from its download page. 
- 
		    					    		    LMDE 7 Now AvailableLinux Mint Debian Edition, version 7, has been officially released and is based on upstream Debian. 
- 
		    					    		    Linux Kernel 6.16 Reaches EOLLinux kernel 6.16 has reached its end of life, which means you'll need to upgrade to the next stable release, Linux kernel 6.17. 
- 
		    					    		    Amazon Ditches Android for a Linux-Based OSAmazon has migrated from Android to the Linux-based Vega OS for its Fire TV. 
- 
		    					    		    Cairo Dock 3.6 Now Available for More CompositorsIf you're a fan of third-party desktop docks, then the latest release of Cairo Dock with Wayland support is for you. 
- 
		    					    		    System76 Unleashes Pop!_OS 24.04 BetaSystem76's first beta of Pop!_OS 24.04 is an impressive feat. 
- 
		    					    		    Linux Kernel 6.17 is AvailableLinus Torvalds has announced that the latest kernel has been released with plenty of core improvements and even more hardware support. 
- 
		    					    		    Kali Linux 2025.3 Released with New Hacking ToolsIf you're a Kali Linux fan, you'll be glad to know that the third release of this famous pen-testing distribution is now available with updates for key components. 





