Consider a sequence of Bernoulli trials between players A and B in which player A wins each trial with probability p∈[0,1]. For positive integers n and k with k∈n, an (n,k) contest is one in which the first player to win at least n trials and to be ahead of his opponent by at least k trials wins the contest. The (n,1) contest is the Banach match problem and the (n,n) contest is the gambler’s ruin problem. Many real contests (such as the World Series in baseball and the tennis game) have an (n,1) or an (n,2) format. The (n,k) contest is formulated in terms of the first-exit time of the graph of a random walk from a certain region of the state-time space. Explicit results are obtained for the probability that player A wins an (n,k) contest and the expected number of trials in an (n,k) contest. Comparisons of (n,k) contests are made in terms of the probability that the stronger player wins and the expected number of trials.
