• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

Modelling Probabilities in Tennis. In this investigation I shall examine the possibilities for modelling the probabilities in tennis matches of varying complexity.

Extracts from this document...

Introduction

Daniel Bregman                14/07/2011

Modelling Probabilities in Tennis

Introduction:

In this investigation I shall examine the possibilities for modelling the probabilities in tennis matches of varying complexity. I will begin by assuming a very simple game of ten points, played by players of a consistent known strength. I will then expand this into games following the real-life rules of tennis more closely, to see how these affect the probabilities involved. I will examine how any results may be generalized to players of different strengths, and how these strengths affect the odds of such players over matches.

A simple model:

Let us assume two players Adam and Ben (who will be referred to as A and B), with fixed probability of scoring a given point against each other. Let A win of points, and B win image00.pngof points.

We can begin by simulating a 10-point game. As the probabilities are consistent, and there are only two possibilities for each point, the game is a series of Bernoulli trials and can be modelled with a binomial distribution. Let X denote the number of points scored by A. We can now state that:

image11.png

and therefore that:

image20.png.

We can hence easily calculate the probability distribution for all possibly values of X:

x

P(X=x)

0

0.000017

1

0.000339

2

0.003048

3

0.016258

4

0.056902

5

0.136565

6

0.227608

7

0.260123

8

0.195092

9

0.086708

10

0.017342

This can be presented as a histogram:

image31.png

This shows that the modal score will be 7, with the highest individual probability.

...read more.

Middle

0.2963

6

0.2195

7

0.2195

This can be shown as a histogram:

image04.png

Based on this data we can calculate the probability that A wins the game:

image05.png

The odds that A wins are therefore:

image06.png

For more general players C and D with point probabilities c and d, the probability that C wins is given by:

image07.png

Note that because on one point C and D’s probabilities of scoring are mutually exclusive and exhaustive, we can say that:

image08.png

In this way the probability of C winning can be written entirely in terms of C’s probability.

Longer game play:

In the above examples the rules ensured that y, the number of points played, could not exceed 7. If instead the rules become that to win, a player must have 4 points and be 2 points ahead of their opponent, we can produce theoretically infinite games. The word ‘deuce’ will be used to refer to a state where the scores are equal and greater than 2, and the word ‘advantage’ will refer to the state after deuce where there is a 1 point difference.

To model this situation, we can consider two possibilities: a game with deuce and a game without deuce. We will discuss the latter first.

If the game is to occur without deuce, it must end at 4-0, 4-1, 4-2, or the reverses of these. Any other score would either be too low to win, or would have involved deuce (e.g.

...read more.

Conclusion

c:

c

P(Cwins)

odds

0

0.000000

0:1

0.05

0.000092

1:10830

0.1

0.001447

1:689.70

0.15

0.007137

1:139.11

0.2

0.021779

1:44.916

0.25

0.050781

1:18.692

0.3

0.099211

1:9.0795

0.35

0.170355

1:4.8701

0.4

0.264271

1:2.7840

0.45

0.376852

1:1.6536

0.5

0.500000

1:1.0000

0.55

0.623149

1.6536:1

0.6

0.735729

2.7840:1

0.65

0.829645

4.8701:1

0.7

0.900989

9.0795:1

0.75

0.949219

18.692:1

0.8

0.978221

44.916:1

0.85

0.992863

139.11:1

0.9

0.998552

689.70:1

0.95

0.999908

10830:1

1.0

1.000000

1:0

The relationship can be shown graphically:

image32.png

This shows that when the point probabilities are close to each other (i.e. near 0.5) a small change can make a large difference in the overall game probabilities, whereas if the point probabilities are far apart a change will not make much difference.

In practical terms, this means (perhaps unsurprisingly) that matches with closely-matched players are the most exciting to watch, because a small change in the player’s relative performance can change the likelihoods dramatically, making the game less predictable.

Conclusions:

These results must be interpreted based on the limitations identified at the start. The results hold for cases with perfectly consistent players, but this is not the case in real life. The changes in performance that would result from tiredness as the game goes on, or from confidence (or the lack thereof) as one player succeeds and the other does not, would significantly change the probabilities in ways that this model cannot predict. Because of this the model would need to be made much more complex if it were to serve as a predictor of real-life situations. However, as a tool to explore the mechanisms at play in a game of tennis, the simple model that we have developed shows clearly how the players’ relative strengths affect the overall result, and also how the rules of play that allow a game to go on longer significantly enhance a strong player’s advantage, so the model is not entirely useless.

...read more.

This student written piece of work is one of many that can be found in our International Baccalaureate Maths section.

Found what you're looking for?

  • Start learning 29% faster today
  • 150,000+ documents available
  • Just £6.99 a month

Not the one? Search for your essay title...
  • Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

See related essaysSee related essays

Related International Baccalaureate Maths essays

  1. Math IA type 2. In this task I will be investigating Probabilities and investigating ...

    Adam wins the point] or failure [the event does not occur ex. Adam does not win the point]. * The probability of success p, is a constant for all trials. * The probability of failure q is a constant for all trials.

  2. Modelling Probabilities in Games of Tennis

    and P(B). Possible alterations could be the conditions the players play under. Adam could play a lot worst when the temperature increases, whereas Ben might play better on hard courts than on grass courts. Chance simply represents either Ben or Adam having a good day.

  1. A logistic model

    2.9 ? (?3.8 ? 10?5 )(1? 104 ) ? 3.28 Hence the equation of the linear growth factor is: r ? ?3.8 ?10?5 u ? 3.28 {10} n n Using equations {1} and {2}, one can find the equation for un+1: 11 IB Mathematics HL Type II Portfolio: Creating a logistic model International School of Helsingborg - Christian Jorgensen un?1 ?

  2. THE DICE GAME - calculating probabilities

    Solution: A = case where Ann is winning B = case where Bob is winning N = case neither Ann and Bob is winning Since both have dices with 6 sides, the total number of combinations when both rooling is 6 x 6 = 36.

  1. Function Transformation Investigation

    is perpendicular to the x axis (input). Negating the input values creates a similar transformation, but horizontally, because the input values are done along the x axis. Inversing the input or output of a function is also something to be considered: Graph of And Graph of: And The transformations that appears on these functions are a bit more complex, but easily understandable.

  2. Population trends. The aim of this investigation is to find out more about different ...

    The shift of the curve was caused by having an equation with the parameters where is yet another constant which will create a shift in the sine curve. The formula for this curve is in which the major changes include the addition of to the equation as being -1 and

  1. The purpose of this investigation is to create and model a dice-based casino game ...

    Let the ordered pair (m,n) represent the case in which player A rolls a number m and player B rolls a number n such that m and n are integers, , and . Now consider the ordered pair (a,b) where . For every such pair (a,b), there exists another pair (b,a); thus there exists a one-to-one correspondence between the sets of (a,b)

  2. The purpose of this investigation is to explore the various properties and concepts of ...

    Det p000lk00hgf0dcba = p× k× f× a If matrix A is an upper triangular matrix, the determinant of the matrix can be found by multiplying the leading diagonals. If these diagonals multiply to give a value of 1, then this method can be used to construct a scramble matrix with a determinant of 1, as shown below.

  • Over 160,000 pieces
    of student written work
  • Annotated by
    experienced teachers
  • Ideas and feedback to
    improve your own work