On the Independence and Identical Distribution of Points in Tennis
暂无分享,去创建一个
[1] David Gale,et al. Optimal Strategy for Serving in Tennis , 1971 .
[2] John G. Kemeny,et al. Finite Markov chains , 1960 .
[3] H. Maisel. Best k of 2k — 1 Comparisons , 1966 .
[4] G. Pollard. A stochastic analysis of scoring systems , 1988, Bulletin of the Australian Mathematical Society.
[5] J. G. Kingston. Comparison of Scoring Systems in Two-Sided Competitions , 1976, J. Comb. Theory, Ser. A.
[6] G. Pollard,et al. AN ANALYSIS OF CLASSICAL AND TIE‐BREAKER TENNIS , 1983 .
[7] Leonard Gillman,et al. Missing More Serves May Win More Points , 1985 .
[8] Graham H. Pollard. A New Tennis Scoring System , 1987 .
[9] Franc J. G. M. Klaassen,et al. The final set in a tennis match: Four years at Wimbledon , 1999 .
[10] G. R. Lindsey,et al. The Progress of the Score during a Baseball Game , 1961 .
[11] B. P. Hsi,et al. Games of Two Players , 1971 .
[12] Aldo Rustichini,et al. Skill, Strategy and Passion : An Empirical Analysis of Soccer , 1998 .
[13] S. Glaister. Urban travel demand : Thomas A. Domencich and Daniel McFadden, (North-Holland Amsterdam, 1975) pp. xvi + 216, $23.25. , 1977 .
[14] David Jackson,et al. Heavy Defeats in Tennis: Psychological Momentum or Random Effect? , 1997 .
[15] S. Christian Albright,et al. A Statistical Analysis of Hitting Streaks in Baseball , 1993 .
[16] W. H. Carter,et al. An Analysis of the Game of Tennis , 1974 .
[17] J. Magnus,et al. On the advantage of serving first in a tennis set: four years at Wimbledon , 1999 .
[18] John M. Norman,et al. Dynamic Programming in Tennis—When to Use a Fast Serve , 1985 .
[19] Gaston Fischer,et al. Exercise in probability and statistics, or the probability of winning at tennis , 1980 .
[20] Keuzeprobleem op centre court , 1995 .