Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

As you know, we use the "Secretary Problem" to choose the single best candidate. Now I would like to know can we use this rule to find the worst candidate, too? If yes, how to accomplish this?

share|cite|improve this question
Just turn the evaluation upside down, i.e., "better" ~~-> "worse" – vonbrand Mar 3 '14 at 16:17
There is a useful lesson here: When you have an algorithm or a theorem involving an ordering, it usually works for the opposite ordering too (though not always). – Jørgen Fogh Mar 4 '14 at 12:57
@JørgenFogh Interesting thought. Can you give examples which use ordinal (not interval/ratio) data which won't work? Or are interval/ratio algorithms the exceptions you were referring to? ACtually, I think maybe I should ask this in its own question. – rumtscho Mar 4 '14 at 16:14
@JørgenFogh I doubt there's any decision algorithm which won't work for the opposite ordering. An example would be really nice. – flonk Mar 6 '14 at 16:13
I think I expressed myself incorrectly. What I was trying to convey was that you cannot assume something always works, just because you can't think of a counterexample. – Jørgen Fogh Mar 6 '14 at 16:45
up vote 45 down vote accepted


The algorithm simply finds the participant who is optimal according to some property, but does not care what that property means (as long as it defines an ordering relation on the candidates). Changing that property from being good to being bad (or whatever else) is just a definition without algorithmic relevance.

share|cite|improve this answer

I think he wants to know if you can use the procedure to choose the worst (instead of the best) candidate. The answer is yes.

The situation is: you know how many candidates $N$ there are, but you don't know the distribution of the quality of the candidates. Also, you can only look at one candidate at a time, and not go back to a previous candidates ("no recall").

You use the $1/e$ algorithm: first look at $1/e$ of the $N$ candidates, and remember the quality of the worst of those, which is, say, $\underline{q}$. After the $N/e$ sampled candidates, you choose the first candidate that is worse than what you have previously seen, i.e., you choose candidate $i$ if $q_i\le \underline{q}$, and candidate $N$ if no candidate's quality was worse. This procedure maximizes the probability to choose the worst candidate.

This is just the inversion of the solution to maximize the probability to choose the best candidate.

share|cite|improve this answer

Sure, the algorithm will just choose a highly ranked candidate (probably). It's up to you how you rank them - by how good they are, or by how bad they are, the algorithm doesn't know what the ranking system means.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.