On the Duration of the Problem of the Points
研究了r玩家点数问题的持续时间，证明总游戏次数N是递增失效率随机变量，并给出关于概率和需求数的Schur凸性结果。
Abstract We consider an r-player version of the famous problem of the points, which was the stimulus for the correspondence between Pascal and Fermat in the 17th century. At each play of a game, exactly one of the players wins a point, player i winning with probability pi. The game ends the first time a player has accumulated his or her required number of points—this requirement being ni for player i. A reliability application would be to suppose that a system is subject to r different types of shocks and failure occurs the first time there have been ni type i shocks for any i = 1, …, r. Our main result is to show that N, the total number of plays, is an increasing failure-rate random variable. In addition, we prove some Schur convexity results regarding P{N ≤ k} as a function of p (for ni ≡ n) and as a function of n (for pi ≡ 1/r). Key Words: Problem of the pointsDuration of playIncreasing failure rateSchur convex