Skip to main content Accessibility help

More on n-point, win-by-k games

  • John Haigh (a1)


When Siegrist (1989) derived an expression for the probability that player A wins a game that consists of a sequence of Bernoulli trials, the winner being the first player to win n trials and have a lead of at least k, he noted the desirability of giving a direct probabilistic argument. Here we present such an argument, and extend the domain of applicability of the results beyond Bernoulli trials, including cases (such as the tie-break in lawn tennis) where the probability of winning each trial cannot reasonably be taken as constant, and to where there is Markov dependence between successive trials.


Corresponding author

Postal address: School of Mathematical Sciences, University of Sussex, Falmer, Brighton BN1 9QH, UK.


Hide All
Feller, W. (1969) An Introduction to Probability Theory and its Applications. Vol. 1, 3rd edn. Wiley, New York.
Mohan, C. (1955) The gambler's ruin problem with correlation. Biometrika 42, 486–193.
Proudfoot, A. D. and Lampard, D. G. (1972) A random walk problem with correlation. J Appl. Prob. 9, 436440.
Renshaw, E. and Henderson, R. (1981) The correlated random walk. J. Appl. Prob. 18, 403414.
Siegrist, K. (1989) n-point, win-by-k-games. J. Appl. Prob. 26, 807814.


MSC classification


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed