Two players, A and B , play a game with a series of trials (like rock-paper-scissors). During any particular trial, P ( A wins ) = P ( B wins ) = p > 0 , P ( Draw occurs ) = 1 − 2 p > 0 . That is, each player has an above zero chance of winning a trial but there is also a chance of a draw.
If they keep playing until one player wins two trials, then find the probability that A eventually wins the game.
Clarification:
Whoever wins two trials first wins the game.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great solution. If we were to generalize to them playing until someone wins k > 2 games, would there be a scenario where p > 0 is small enough and k large enough so that P(A wins) is something other than 1/2? That is, is there a scenario where we can expect the contest to never end?
Log in to reply
Interesting question, I tried generalizing but hit a wall. I think an equivalent way to form your question is if the above game is played best 2 n + 1 out of n games is it a fair game? That is P ( A wins ) = P ( B wins ) ?
Log in to reply
As long as the two have the same probability of winning any given game then the contest is fair, but if they are playing a best n + 1 out of 2 n + 1 games then, since the probability of a draw is non-zero, there is a chance that neither will win the contest. If the contest is open-ended and ends only when the first player reaches k wins for some integer k , then I believe that the contest will end with probability 1 regardless of k , and that P(A wins) = P(wins) = 1/2. If the contest is not open-ended, so that either must win k of n games or else the overall contest is a draw, then we would have variables p , k and n to work with, which would be even more difficult to generalize. Yet another variation would be where the winner of the contest is the one who has the most wins after n games, again setting up the possibility that they could be tied after n games.
Log in to reply
@Brian Charlesworth – I believe that the proper generalized context is considering the scenario of infinitely many games, e.g. the first person to win at least k out of the most recent n games is the winner.
For all values of k , n , I believe that the probability would always be 1/2.
In the question, you should clarify if it's "a total of two wins" or "two consecutive wins".
Log in to reply
Just changed it. Tried to make it as clear as possible. Just find word problems to be the hardest to write.
Log in to reply
I do not see any edits made by you. Did you remember to hit the save button after previewing your changes?
Practice makes perfect. Simply remember that your reader is not a mind-reader (yet), and so all of your conditions need to be stated. As you're writing up the solution, check that these conditions / assumptions appear in the problem itself :)
Because of symmetry, no calculations are needed. The chance of A to win are the same as B's. The chance of no one winning is sufficiently small that the answer must be 0.5.
It would be better to be accurate and explain why "the change of no one winning is 0".
If there are no draws, that is P ( Draw ) = 0 , then at most you can have 3 games. The orderings or sample space for winning the whole game is Ω = { W W , L L , W L W , L W L } . Then P ( A wins ) = 2 1 as there are two ways of winning the entire contest out of four.
Problem Loading...
Note Loading...
Set Loading...
Since the players are playing until one wins 2 games, they need to play at least 2 games.
Let A i be the event that player A wins the i th game where i ∈ [ 2 , ∞ ) , then P ( A wins game ) = P ( i = 2 ⋃ ∞ A i ) P ( A i ) = P ( B i ∪ C i )
Where B i = { A wins on the ith game and B wins one game } and
C i = { A wins on the ith game and B wins no games }
These are the only ways for A to win on the i th round because if A lost twice then he or she could not possibly win. Furthermore, as B i ∩ C i = ∅ , for all i , that is the above events cannot occur simultaneously, we have
P ( B i ∪ C i ) = P ( B i ) + P ( C i )
P ( C i ) = ( 1 i − 1 ) ( 1 − 2 p ) i − 2 p 2 , P ( B i ) = 1 ! 1 ! ( i − 3 ) ! ( i − 1 ) ! ( 1 − 2 p ) i − 3 p 3 As A i ∩ A j = ∅ , when i = j , we apply countable additivity and get P ( i = 2 ⋃ ∞ A i ) = i = 2 ∑ ∞ P ( A i ) = i = 2 ∑ ∞ P ( B i ) + P ( C i ) = ( i − 1 ) ( 1 − 2 p ) i − 2 p 2 + ( i − 1 ) ( i − 2 ) ( 1 − 2 p ) i − 3 p 3 Letting i − 1 = n , we have: P ( A wins game ) = n = 1 ∑ ∞ n ( 1 − 2 p ) n − 1 p 2 + n ( n − 1 ) ( 1 − 2 p ) n − 2 p 3
Recall, If X ∼ g e o ( 2 p ) ,that is if X denotes a geometric random variables with parameter 2 p , then P ( X = k ) = ( 1 − 2 p ) k − 1 2 p .
Further, E [ X ] = ∑ k = 1 ∞ k ( 1 − 2 p ) k − 1 2 p = 2 p 1 and
E [ X 2 ] = ∑ k = 1 ∞ k 2 ( 1 − 2 p ) k − 1 2 p = V a r ( X ) + E [ X ] 2 = 4 p 2 1 − 2 p + 4 p 2 1 = 4 p 2 2 − 2 p (These formulas can be found in the references below)
By algebraic mainpulation we can obtain the following: = 1 − 2 p p 2 ( 2 p 1 − 3 p n = 1 ∑ ∞ n ( 1 − 2 p ) n − 1 2 p + 2 1 n = 1 ∑ ∞ n 2 ( 1 − 2 p ) n − 1 2 p )
We can now substitute E [ X ] and E [ X 2 ] respectively for the 2 infinite sums above. P ( A wins the game ) = 1 − 2 p p 2 ( 4 p 2 1 − 3 p + ( 2 1 ) ( 4 p 2 2 − 2 p ) ) = ( 1 − 2 p p 2 ) ( 4 p 2 2 − 4 p ) = 2 1
https://en.wikipedia.org/wiki/Geometric_distribution
https://en.wikipedia.org/wiki/Variance#Definition