How does this contend with other optimal stopping problems? I just started reading 'Algorithms to Live By' and the very first chapter talks about the 37% rule [1], which feels similar. According to The Dating Problem [2] I should reject the first 37 candidates (when N=100 like in OP's example)
Reject 33 candidates if you want to maximize your likelihood of getting the best candidate out of 100, and 9 if you want to maximize how good the candidate you get is.