Calculate probability of an infinite geometric series

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite
1













Suppose in a single round, I win with probability p, and you win with probability
1 − p. We play repeatedly and keep score until one of us is two ahead (for example
a score of 2 − 0, 3 − 1, 2 − 4, etc.). What is the probability that I win overall?




I have been working through this probability problem. But I am not sure if my method is the most efficient or even may not be even correct and was wondering if someone could advise if I am carrying this out correctly, and if there more effective way of approaching this type of question?



My method for calculation



Tree Diagram



If I have understood the above question correctly, the only way to win is if you I am 2 ahead?



So one way I could win two time in a row would if I have a probability of $p^2$.



But if I get a $p$ then a $q$ or the other persons throws and $q$ then $p$ we have drawn, so to me this is like starting again i.e $0-0$ again so for me two win now I would need the following $pqpp=p^3 q$ or if I draw again then I would need to win the following $pqpqpp=p^4 q^2$ and so fourth.



As probabilities are independent (each future try is not effected by the previous) then I can add the following probabilities to find my overall chance of winning.



$P(Over :all :win)=p^2+p^3q+p^4q^2+.....=p^2+p^3(1-p)+p^3(1-p)^2+....$



so now using the infite geometric sum $S=fracp^21-p(1-p)=fracp^21-p+p^2$.



So my probability for winning over all is:



$$P(Over :all :win)=fracp^21-p+p^2$$



I am bit rusty with probability as it something I don’t do too often. But as mentioned is there more efficient way of approaching this type of question, as I was thinking of extending this question and exploring if I had to be 3 ahead what would the over all win be.







share|cite|improve this question






















  • Your reasoning shows the probability $w$ that you win solves $$w=p^2cdot1+2pqcdot w+q^2cdot0$$ hence $$w=fracp^21-2pq=fracp^2p^2+q^2$$
    – Did
    Aug 18 at 0:03











  • I am a bit confused by your comment. Because the 2pq would be if I drew which means that I am effectively starting from 0-0 as i mentioned or 1-1 which is why. Could you please expamded you comment into an answer?
    – james2018
    Aug 18 at 7:36










  • I am a bit confused by your confusion: $2pq$ is the probability that after two games, the players are again even. When this happens, your chances to win are exactly what they were at the start of the game, hence the term $2pqcdot w$. What is unclear there?
    – Did
    Aug 18 at 12:10











  • Yes that I understand that. But my reasoning is that probability will not effect the overall chance of me winning as so to speak the game resets. Which is why I never included the probability and noticed that it formed a geometric sum for the overall. That how I see the question itself
    – james2018
    Aug 18 at 12:38














up vote
2
down vote

favorite
1













Suppose in a single round, I win with probability p, and you win with probability
1 − p. We play repeatedly and keep score until one of us is two ahead (for example
a score of 2 − 0, 3 − 1, 2 − 4, etc.). What is the probability that I win overall?




I have been working through this probability problem. But I am not sure if my method is the most efficient or even may not be even correct and was wondering if someone could advise if I am carrying this out correctly, and if there more effective way of approaching this type of question?



My method for calculation



Tree Diagram



If I have understood the above question correctly, the only way to win is if you I am 2 ahead?



So one way I could win two time in a row would if I have a probability of $p^2$.



But if I get a $p$ then a $q$ or the other persons throws and $q$ then $p$ we have drawn, so to me this is like starting again i.e $0-0$ again so for me two win now I would need the following $pqpp=p^3 q$ or if I draw again then I would need to win the following $pqpqpp=p^4 q^2$ and so fourth.



As probabilities are independent (each future try is not effected by the previous) then I can add the following probabilities to find my overall chance of winning.



$P(Over :all :win)=p^2+p^3q+p^4q^2+.....=p^2+p^3(1-p)+p^3(1-p)^2+....$



so now using the infite geometric sum $S=fracp^21-p(1-p)=fracp^21-p+p^2$.



So my probability for winning over all is:



$$P(Over :all :win)=fracp^21-p+p^2$$



I am bit rusty with probability as it something I don’t do too often. But as mentioned is there more efficient way of approaching this type of question, as I was thinking of extending this question and exploring if I had to be 3 ahead what would the over all win be.







share|cite|improve this question






















  • Your reasoning shows the probability $w$ that you win solves $$w=p^2cdot1+2pqcdot w+q^2cdot0$$ hence $$w=fracp^21-2pq=fracp^2p^2+q^2$$
    – Did
    Aug 18 at 0:03











  • I am a bit confused by your comment. Because the 2pq would be if I drew which means that I am effectively starting from 0-0 as i mentioned or 1-1 which is why. Could you please expamded you comment into an answer?
    – james2018
    Aug 18 at 7:36










  • I am a bit confused by your confusion: $2pq$ is the probability that after two games, the players are again even. When this happens, your chances to win are exactly what they were at the start of the game, hence the term $2pqcdot w$. What is unclear there?
    – Did
    Aug 18 at 12:10











  • Yes that I understand that. But my reasoning is that probability will not effect the overall chance of me winning as so to speak the game resets. Which is why I never included the probability and noticed that it formed a geometric sum for the overall. That how I see the question itself
    – james2018
    Aug 18 at 12:38












up vote
2
down vote

favorite
1









up vote
2
down vote

favorite
1






1






Suppose in a single round, I win with probability p, and you win with probability
1 − p. We play repeatedly and keep score until one of us is two ahead (for example
a score of 2 − 0, 3 − 1, 2 − 4, etc.). What is the probability that I win overall?




I have been working through this probability problem. But I am not sure if my method is the most efficient or even may not be even correct and was wondering if someone could advise if I am carrying this out correctly, and if there more effective way of approaching this type of question?



My method for calculation



Tree Diagram



If I have understood the above question correctly, the only way to win is if you I am 2 ahead?



So one way I could win two time in a row would if I have a probability of $p^2$.



But if I get a $p$ then a $q$ or the other persons throws and $q$ then $p$ we have drawn, so to me this is like starting again i.e $0-0$ again so for me two win now I would need the following $pqpp=p^3 q$ or if I draw again then I would need to win the following $pqpqpp=p^4 q^2$ and so fourth.



As probabilities are independent (each future try is not effected by the previous) then I can add the following probabilities to find my overall chance of winning.



$P(Over :all :win)=p^2+p^3q+p^4q^2+.....=p^2+p^3(1-p)+p^3(1-p)^2+....$



so now using the infite geometric sum $S=fracp^21-p(1-p)=fracp^21-p+p^2$.



So my probability for winning over all is:



$$P(Over :all :win)=fracp^21-p+p^2$$



I am bit rusty with probability as it something I don’t do too often. But as mentioned is there more efficient way of approaching this type of question, as I was thinking of extending this question and exploring if I had to be 3 ahead what would the over all win be.







share|cite|improve this question















Suppose in a single round, I win with probability p, and you win with probability
1 − p. We play repeatedly and keep score until one of us is two ahead (for example
a score of 2 − 0, 3 − 1, 2 − 4, etc.). What is the probability that I win overall?




I have been working through this probability problem. But I am not sure if my method is the most efficient or even may not be even correct and was wondering if someone could advise if I am carrying this out correctly, and if there more effective way of approaching this type of question?



My method for calculation



Tree Diagram



If I have understood the above question correctly, the only way to win is if you I am 2 ahead?



So one way I could win two time in a row would if I have a probability of $p^2$.



But if I get a $p$ then a $q$ or the other persons throws and $q$ then $p$ we have drawn, so to me this is like starting again i.e $0-0$ again so for me two win now I would need the following $pqpp=p^3 q$ or if I draw again then I would need to win the following $pqpqpp=p^4 q^2$ and so fourth.



As probabilities are independent (each future try is not effected by the previous) then I can add the following probabilities to find my overall chance of winning.



$P(Over :all :win)=p^2+p^3q+p^4q^2+.....=p^2+p^3(1-p)+p^3(1-p)^2+....$



so now using the infite geometric sum $S=fracp^21-p(1-p)=fracp^21-p+p^2$.



So my probability for winning over all is:



$$P(Over :all :win)=fracp^21-p+p^2$$



I am bit rusty with probability as it something I don’t do too often. But as mentioned is there more efficient way of approaching this type of question, as I was thinking of extending this question and exploring if I had to be 3 ahead what would the over all win be.









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 18 at 0:57









Bernard

111k635103




111k635103










asked Aug 17 at 23:37









james2018

304




304











  • Your reasoning shows the probability $w$ that you win solves $$w=p^2cdot1+2pqcdot w+q^2cdot0$$ hence $$w=fracp^21-2pq=fracp^2p^2+q^2$$
    – Did
    Aug 18 at 0:03











  • I am a bit confused by your comment. Because the 2pq would be if I drew which means that I am effectively starting from 0-0 as i mentioned or 1-1 which is why. Could you please expamded you comment into an answer?
    – james2018
    Aug 18 at 7:36










  • I am a bit confused by your confusion: $2pq$ is the probability that after two games, the players are again even. When this happens, your chances to win are exactly what they were at the start of the game, hence the term $2pqcdot w$. What is unclear there?
    – Did
    Aug 18 at 12:10











  • Yes that I understand that. But my reasoning is that probability will not effect the overall chance of me winning as so to speak the game resets. Which is why I never included the probability and noticed that it formed a geometric sum for the overall. That how I see the question itself
    – james2018
    Aug 18 at 12:38
















  • Your reasoning shows the probability $w$ that you win solves $$w=p^2cdot1+2pqcdot w+q^2cdot0$$ hence $$w=fracp^21-2pq=fracp^2p^2+q^2$$
    – Did
    Aug 18 at 0:03











  • I am a bit confused by your comment. Because the 2pq would be if I drew which means that I am effectively starting from 0-0 as i mentioned or 1-1 which is why. Could you please expamded you comment into an answer?
    – james2018
    Aug 18 at 7:36










  • I am a bit confused by your confusion: $2pq$ is the probability that after two games, the players are again even. When this happens, your chances to win are exactly what they were at the start of the game, hence the term $2pqcdot w$. What is unclear there?
    – Did
    Aug 18 at 12:10











  • Yes that I understand that. But my reasoning is that probability will not effect the overall chance of me winning as so to speak the game resets. Which is why I never included the probability and noticed that it formed a geometric sum for the overall. That how I see the question itself
    – james2018
    Aug 18 at 12:38















Your reasoning shows the probability $w$ that you win solves $$w=p^2cdot1+2pqcdot w+q^2cdot0$$ hence $$w=fracp^21-2pq=fracp^2p^2+q^2$$
– Did
Aug 18 at 0:03





Your reasoning shows the probability $w$ that you win solves $$w=p^2cdot1+2pqcdot w+q^2cdot0$$ hence $$w=fracp^21-2pq=fracp^2p^2+q^2$$
– Did
Aug 18 at 0:03













I am a bit confused by your comment. Because the 2pq would be if I drew which means that I am effectively starting from 0-0 as i mentioned or 1-1 which is why. Could you please expamded you comment into an answer?
– james2018
Aug 18 at 7:36




I am a bit confused by your comment. Because the 2pq would be if I drew which means that I am effectively starting from 0-0 as i mentioned or 1-1 which is why. Could you please expamded you comment into an answer?
– james2018
Aug 18 at 7:36












I am a bit confused by your confusion: $2pq$ is the probability that after two games, the players are again even. When this happens, your chances to win are exactly what they were at the start of the game, hence the term $2pqcdot w$. What is unclear there?
– Did
Aug 18 at 12:10





I am a bit confused by your confusion: $2pq$ is the probability that after two games, the players are again even. When this happens, your chances to win are exactly what they were at the start of the game, hence the term $2pqcdot w$. What is unclear there?
– Did
Aug 18 at 12:10













Yes that I understand that. But my reasoning is that probability will not effect the overall chance of me winning as so to speak the game resets. Which is why I never included the probability and noticed that it formed a geometric sum for the overall. That how I see the question itself
– james2018
Aug 18 at 12:38




Yes that I understand that. But my reasoning is that probability will not effect the overall chance of me winning as so to speak the game resets. Which is why I never included the probability and noticed that it formed a geometric sum for the overall. That how I see the question itself
– james2018
Aug 18 at 12:38










1 Answer
1






active

oldest

votes

















up vote
-1
down vote













The case is random walk start at 0, reach 2 before -2. Recall Gambler's ruin
. The proof if you learned martingale is trivial, otherwises you can use $P_k=pP_k+1+(1-p)P_k-1$ and bound condition prob 0,1 to derive.






share|cite|improve this answer




















    Your Answer




    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "69"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );








     

    draft saved


    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2886288%2fcalculate-probability-of-an-infinite-geometric-series%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    -1
    down vote













    The case is random walk start at 0, reach 2 before -2. Recall Gambler's ruin
    . The proof if you learned martingale is trivial, otherwises you can use $P_k=pP_k+1+(1-p)P_k-1$ and bound condition prob 0,1 to derive.






    share|cite|improve this answer
























      up vote
      -1
      down vote













      The case is random walk start at 0, reach 2 before -2. Recall Gambler's ruin
      . The proof if you learned martingale is trivial, otherwises you can use $P_k=pP_k+1+(1-p)P_k-1$ and bound condition prob 0,1 to derive.






      share|cite|improve this answer






















        up vote
        -1
        down vote










        up vote
        -1
        down vote









        The case is random walk start at 0, reach 2 before -2. Recall Gambler's ruin
        . The proof if you learned martingale is trivial, otherwises you can use $P_k=pP_k+1+(1-p)P_k-1$ and bound condition prob 0,1 to derive.






        share|cite|improve this answer












        The case is random walk start at 0, reach 2 before -2. Recall Gambler's ruin
        . The proof if you learned martingale is trivial, otherwises you can use $P_k=pP_k+1+(1-p)P_k-1$ and bound condition prob 0,1 to derive.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Aug 18 at 0:05









        Sebastian Theriault

        11




        11






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2886288%2fcalculate-probability-of-an-infinite-geometric-series%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            tkz-euclide: tkzDrawCircle[R] not working

            How to combine Bézier curves to a surface?

            1st Magritte Awards