Signature

Secretary Problem. Strategy to select the Best Candidate

Jun 12, 2017

Interactive Visualization of Secretary Problem. Can you beat it's theoretical best probability of success? Concept is explained in a video below.

Click on green call button to begin. Afetr 5 to 10 trials, if your score is greater than theoretical best, you have a winning strategy. Might not work on mobile

Your (Best Hires/ Total Trials) (0/0)
0%
Theoretical highest probability
of Best Hire
43%

Try changing number of candidates, ā€˜nā€™ above

Possibilities

Excel file

References

Thank You

I can be reached at pavanmirla@perceptron.solutions

BTW, you might also like these

Machine Learning Posts

Precision, Recall and F1 Score Secretary Problem. Strategy to select the Best Candidate A walk through Machine Learning Conference held at Toronto Introduction to the concept of Cross Entropy and its application Build a Neural Net to solve Exclusive OR (XOR) problem AI Winter. How Canadians contributed to end it? Perceptron Learning Algorithm in plain words Maximum Likelihood Estimate and Logistic Regression simplified Deep Learning highlights Month by Month Intuition behind concept of Gradient

Finance Posts

IPO Stocks Performance in 2019 S&P500 2018 returns Let's learn about Convertible Note SP500 Stocks Performance in 2017

General

Immense Power of Interactive Math Explainers

R/Python