How to select a loser

Abstract. $N$ people select a {\it loser} by flipping coins. Recursively, the 0-party continues until the loser is found. Among other things, it is shown that this process stops on the average after about $\log_2N$ steps. Nevertheless, this very plausible result requires rather advanced methods.
This paper is available in the Tex, Dvi, and PostScript format.
(Back to List of Papers)