Solution:
Let us define
- sample space Ω to consist of all possible infinite sequences of points;
- event Wi - nominated player wins the i th point;
- event Vi - nominated player wins the game on the i th point;
- event V - nominated player wins the game.
We want P(V). The events {W1,W1′} partition Ω , and thus, by the Theorem of Total Probability
P(V)=P(V∣W1)P(W1)+P(V∣W1′)P(W1′) ...(1)
Now P(W1)=θ and P(W1′)=1−θ . To get P(V∣W1) and P(V∣W1′) , we need to further condition on the result of the second point, and again use the Theorem: for example
P(V∣W1)P(V∣W1′)=P(V∣W1∩W2)P(W2∣W1)+P(V∣W1∩W2′)P(W2′∣W1)=P(V∣W1′∩W2)P(W2∣W1′)+P(V∣W1′∩W2′)P(W2′∣W1′)
...(2)
where
P(V∣W1∩W2)=1,P(V∣W1∩W2′)=P(V),P(V∣W1′∩W2)=P(V),P(V∣W1′∩W2′)=0,P(W2∣W1)=P(W2)=θP(W2′∣W1)=P(W2′)=1−θ,P(W2∣W1′)=P(W2)=θP(W2′∣W1′)=P(W2′)=1−θ,
as,
given W1∩W2 : the game is over, and the nominated player has won given W1∩W2′ : the game is back at deuce given W1′∩W2 : the game is back at deuce given W1′∩W2′ } : the game is over, and the player has lost
and the results of successive points are independent. Thus
P(V∣W1)P(V∣W1′)=(1×θ)+(P(V)×(1−θ))=θ+(1−θ)P(V)=(P(V)×θ)+0×(1−θ)=θP(V)
Hence, combining (1) and (2), we get
P(V)=(θ+(1−θ)P(V))θ+θP(V)(1−θ)=θ2+2θ(1−θ)P(V)
⇒P(V)=1−2θ(1−θ)θ2
Comments