N people select a loser by flipping coins. Recursively, the 0-party co
ntinues until the loser is found. Among other things, it is shown that
this process stops on the average after about log2 N steps. Neverthel
ess, this very plausible result requires rather advanced methods.