首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Gambler’s ruin and winning a series by <Emphasis Type="Italic">m</Emphasis> games
Authors:Tamás Lengyel
Institution:(1) Canadian Centre for Arts and Technology, University of Waterloo, 200 University Avenue West, Waterloo, ON, N2L 3G1, Canada;(2) Psychology Department, University of Waterloo, 200 University Avenue West, Waterloo, ON, N2L 3G1, Canada
Abstract:Two teams play a series of games until one team accumulates m more wins than the other. These series are fairly common in some sports provided that the competition has already extended beyond some number of games. We generalize these schemes to allow ties in the single games. Different approaches offer different advantages in calculating the winning probabilities and the distribution of the duration N, including difference equations, conditioning, explicit and implicit path counting, generating functions and a martingale-based derivation of the probability and moment generating functions of N. The main result of the paper is the determination of the exact distribution of N for a series of fair games without ties as a sum of independent geometrically distributed random variables and its approximation.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号