Which raises the question - what's the optimal strategy in the double-sided version of the secretary problem? (I'm guessing that it probably involves stopping the 'search' even earlier.)