Expected score of a player in a best-of match The 2019 Stack Overflow Developer Survey Results Are InExpected value equals sum of probabilitiesAn application of probability in tennis gameProb question on gamesProbability of winning a match with different probability of independently winning a game in the match?Probability of winning a game in tennis?Backgammon game competition.Which option should $A$ prefer so that the probability of his winning the match is higher?Given Elo ratings, what is the expected number of points in an X games match?Probability of a chess gameConditional Expectation in a match of Chess with maximum 3 pointsTotal probability of a match, where first to $n$ games wins.

Which Sci-Fi work first showed weapon of galactic-scale mass destruction?

Is there a symbol for a right arrow with a square in the middle?

A poker game description that does not feel gimmicky

Can a rogue use sneak attack with weapons that have the thrown property even if they are not thrown?

One word riddle: Vowel in the middle

Output the Arecibo Message

How to support a colleague who finds meetings extremely tiring?

Button changing it's text & action. Good or terrible?

What is the most effective way of iterating a std::vector and why?

Aging parents with no investments

Is three citations per paragraph excessive for undergraduate research paper?

Why not take a picture of a closer black hole?

Why was M87 targetted for the Event Horizon Telescope instead of Sagittarius A*?

Should I use my personal e-mail address, or my workplace one, when registering to external websites for work purposes?

During Temple times, who can butcher a kosher animal?

Does the shape of a die affect the probability of a number being rolled?

When should I buy a clipper card after flying to OAK?

What tool would a Roman-age civilization have for the breaking of silver and other metals into dust?

What does Linus Torvalds mean when he says that Git "never ever" tracks a file?

Can someone be penalized for an "unlawful" act if no penalty is specified?

Right tool to dig six foot holes?

Time travel alters history but people keep saying nothing's changed

Falsification in Math vs Science

Lightning Grid - Columns and Rows?



Expected score of a player in a best-of match



The 2019 Stack Overflow Developer Survey Results Are InExpected value equals sum of probabilitiesAn application of probability in tennis gameProb question on gamesProbability of winning a match with different probability of independently winning a game in the match?Probability of winning a game in tennis?Backgammon game competition.Which option should $A$ prefer so that the probability of his winning the match is higher?Given Elo ratings, what is the expected number of points in an X games match?Probability of a chess gameConditional Expectation in a match of Chess with maximum 3 pointsTotal probability of a match, where first to $n$ games wins.










1












$begingroup$


Let $n>0$ and the probability for player $A$ to win a single game against $B$ be $p$.



A match consists of multiple independent games.
What is the expected score-line of $A$
if the match ends when $A$ or $B$ wins $n$ games? (best-of-$(2n-1)$)



By simulation, it looks like below for $n=10$ and varying $p$, but whats the formula?



Expected score for <span class=$n=10$ as a function of $p$.">



Sounds easy, but...



Help appreciated! Thanks in advance.










share|cite|improve this question











$endgroup$











  • $begingroup$
    What do you mean by "score line"? Are you just asking for the probability that $A$ wins the match?
    $endgroup$
    – lulu
    Apr 6 at 20:11










  • $begingroup$
    Score line means the result e.g. 10-9, 10-1, or 8-10. For $A$ : 10, 10, 8.
    $endgroup$
    – fwgb
    Apr 6 at 20:15










  • $begingroup$
    Ok, well...the probability that $A$ wins the first $n$ is $p^n$. To get the probability that $A$ wins in exactly $n+1$ games, $A$ must win game $n+1$ and lose exactly one of the first $n$, hence $ntimes (1-p)*p^n$. Can you finish from here?
    $endgroup$
    – lulu
    Apr 6 at 20:17










  • $begingroup$
    But also scores where $A$ lost should contribute to the required expectation.
    $endgroup$
    – fwgb
    Apr 6 at 20:30










  • $begingroup$
    Yes, of course. That's why my expression has terms involving $(1-p)^i$.
    $endgroup$
    – lulu
    Apr 6 at 20:36















1












$begingroup$


Let $n>0$ and the probability for player $A$ to win a single game against $B$ be $p$.



A match consists of multiple independent games.
What is the expected score-line of $A$
if the match ends when $A$ or $B$ wins $n$ games? (best-of-$(2n-1)$)



By simulation, it looks like below for $n=10$ and varying $p$, but whats the formula?



Expected score for <span class=$n=10$ as a function of $p$.">



Sounds easy, but...



Help appreciated! Thanks in advance.










share|cite|improve this question











$endgroup$











  • $begingroup$
    What do you mean by "score line"? Are you just asking for the probability that $A$ wins the match?
    $endgroup$
    – lulu
    Apr 6 at 20:11










  • $begingroup$
    Score line means the result e.g. 10-9, 10-1, or 8-10. For $A$ : 10, 10, 8.
    $endgroup$
    – fwgb
    Apr 6 at 20:15










  • $begingroup$
    Ok, well...the probability that $A$ wins the first $n$ is $p^n$. To get the probability that $A$ wins in exactly $n+1$ games, $A$ must win game $n+1$ and lose exactly one of the first $n$, hence $ntimes (1-p)*p^n$. Can you finish from here?
    $endgroup$
    – lulu
    Apr 6 at 20:17










  • $begingroup$
    But also scores where $A$ lost should contribute to the required expectation.
    $endgroup$
    – fwgb
    Apr 6 at 20:30










  • $begingroup$
    Yes, of course. That's why my expression has terms involving $(1-p)^i$.
    $endgroup$
    – lulu
    Apr 6 at 20:36













1












1








1





$begingroup$


Let $n>0$ and the probability for player $A$ to win a single game against $B$ be $p$.



A match consists of multiple independent games.
What is the expected score-line of $A$
if the match ends when $A$ or $B$ wins $n$ games? (best-of-$(2n-1)$)



By simulation, it looks like below for $n=10$ and varying $p$, but whats the formula?



Expected score for <span class=$n=10$ as a function of $p$.">



Sounds easy, but...



Help appreciated! Thanks in advance.










share|cite|improve this question











$endgroup$




Let $n>0$ and the probability for player $A$ to win a single game against $B$ be $p$.



A match consists of multiple independent games.
What is the expected score-line of $A$
if the match ends when $A$ or $B$ wins $n$ games? (best-of-$(2n-1)$)



By simulation, it looks like below for $n=10$ and varying $p$, but whats the formula?



Expected score for <span class=$n=10$ as a function of $p$.">



Sounds easy, but...



Help appreciated! Thanks in advance.







probability






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Apr 6 at 22:51









Eric Wofsey

192k14220352




192k14220352










asked Apr 6 at 20:00









fwgbfwgb

1284




1284











  • $begingroup$
    What do you mean by "score line"? Are you just asking for the probability that $A$ wins the match?
    $endgroup$
    – lulu
    Apr 6 at 20:11










  • $begingroup$
    Score line means the result e.g. 10-9, 10-1, or 8-10. For $A$ : 10, 10, 8.
    $endgroup$
    – fwgb
    Apr 6 at 20:15










  • $begingroup$
    Ok, well...the probability that $A$ wins the first $n$ is $p^n$. To get the probability that $A$ wins in exactly $n+1$ games, $A$ must win game $n+1$ and lose exactly one of the first $n$, hence $ntimes (1-p)*p^n$. Can you finish from here?
    $endgroup$
    – lulu
    Apr 6 at 20:17










  • $begingroup$
    But also scores where $A$ lost should contribute to the required expectation.
    $endgroup$
    – fwgb
    Apr 6 at 20:30










  • $begingroup$
    Yes, of course. That's why my expression has terms involving $(1-p)^i$.
    $endgroup$
    – lulu
    Apr 6 at 20:36
















  • $begingroup$
    What do you mean by "score line"? Are you just asking for the probability that $A$ wins the match?
    $endgroup$
    – lulu
    Apr 6 at 20:11










  • $begingroup$
    Score line means the result e.g. 10-9, 10-1, or 8-10. For $A$ : 10, 10, 8.
    $endgroup$
    – fwgb
    Apr 6 at 20:15










  • $begingroup$
    Ok, well...the probability that $A$ wins the first $n$ is $p^n$. To get the probability that $A$ wins in exactly $n+1$ games, $A$ must win game $n+1$ and lose exactly one of the first $n$, hence $ntimes (1-p)*p^n$. Can you finish from here?
    $endgroup$
    – lulu
    Apr 6 at 20:17










  • $begingroup$
    But also scores where $A$ lost should contribute to the required expectation.
    $endgroup$
    – fwgb
    Apr 6 at 20:30










  • $begingroup$
    Yes, of course. That's why my expression has terms involving $(1-p)^i$.
    $endgroup$
    – lulu
    Apr 6 at 20:36















$begingroup$
What do you mean by "score line"? Are you just asking for the probability that $A$ wins the match?
$endgroup$
– lulu
Apr 6 at 20:11




$begingroup$
What do you mean by "score line"? Are you just asking for the probability that $A$ wins the match?
$endgroup$
– lulu
Apr 6 at 20:11












$begingroup$
Score line means the result e.g. 10-9, 10-1, or 8-10. For $A$ : 10, 10, 8.
$endgroup$
– fwgb
Apr 6 at 20:15




$begingroup$
Score line means the result e.g. 10-9, 10-1, or 8-10. For $A$ : 10, 10, 8.
$endgroup$
– fwgb
Apr 6 at 20:15












$begingroup$
Ok, well...the probability that $A$ wins the first $n$ is $p^n$. To get the probability that $A$ wins in exactly $n+1$ games, $A$ must win game $n+1$ and lose exactly one of the first $n$, hence $ntimes (1-p)*p^n$. Can you finish from here?
$endgroup$
– lulu
Apr 6 at 20:17




$begingroup$
Ok, well...the probability that $A$ wins the first $n$ is $p^n$. To get the probability that $A$ wins in exactly $n+1$ games, $A$ must win game $n+1$ and lose exactly one of the first $n$, hence $ntimes (1-p)*p^n$. Can you finish from here?
$endgroup$
– lulu
Apr 6 at 20:17












$begingroup$
But also scores where $A$ lost should contribute to the required expectation.
$endgroup$
– fwgb
Apr 6 at 20:30




$begingroup$
But also scores where $A$ lost should contribute to the required expectation.
$endgroup$
– fwgb
Apr 6 at 20:30












$begingroup$
Yes, of course. That's why my expression has terms involving $(1-p)^i$.
$endgroup$
– lulu
Apr 6 at 20:36




$begingroup$
Yes, of course. That's why my expression has terms involving $(1-p)^i$.
$endgroup$
– lulu
Apr 6 at 20:36










1 Answer
1






active

oldest

votes


















0












$begingroup$

Using this it follows



$E = sum_k=1^n P(A$ wins $k$ games before $B$ wins $n)$



which gives



$E = sum _k=1^n sum _j=k^n+k-1 tbinomk+n-1j p^j (1-p)^k+n-1-j$.



This coincides with the simualations. Can we simplify that?






share|cite|improve this answer











$endgroup$













    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',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    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%2f3177382%2fexpected-score-of-a-player-in-a-best-of-match%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0












    $begingroup$

    Using this it follows



    $E = sum_k=1^n P(A$ wins $k$ games before $B$ wins $n)$



    which gives



    $E = sum _k=1^n sum _j=k^n+k-1 tbinomk+n-1j p^j (1-p)^k+n-1-j$.



    This coincides with the simualations. Can we simplify that?






    share|cite|improve this answer











    $endgroup$

















      0












      $begingroup$

      Using this it follows



      $E = sum_k=1^n P(A$ wins $k$ games before $B$ wins $n)$



      which gives



      $E = sum _k=1^n sum _j=k^n+k-1 tbinomk+n-1j p^j (1-p)^k+n-1-j$.



      This coincides with the simualations. Can we simplify that?






      share|cite|improve this answer











      $endgroup$















        0












        0








        0





        $begingroup$

        Using this it follows



        $E = sum_k=1^n P(A$ wins $k$ games before $B$ wins $n)$



        which gives



        $E = sum _k=1^n sum _j=k^n+k-1 tbinomk+n-1j p^j (1-p)^k+n-1-j$.



        This coincides with the simualations. Can we simplify that?






        share|cite|improve this answer











        $endgroup$



        Using this it follows



        $E = sum_k=1^n P(A$ wins $k$ games before $B$ wins $n)$



        which gives



        $E = sum _k=1^n sum _j=k^n+k-1 tbinomk+n-1j p^j (1-p)^k+n-1-j$.



        This coincides with the simualations. Can we simplify that?







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Apr 7 at 19:48

























        answered Apr 6 at 21:02









        fwgbfwgb

        1284




        1284



























            draft saved

            draft discarded
















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3177382%2fexpected-score-of-a-player-in-a-best-of-match%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Hidroelektrana Sadržaj Povijest | Podjela hidroelektrana | Snaga dobivena u hidroelektranama | Dijelovi hidroelektrane | Uloga hidroelektrana u suvremenom svijetu | Prednosti hidroelektrana | Nedostaci hidroelektrana | Države s najvećom proizvodnjom hidro-električne energije | Deset najvećih hidroelektrana u svijetu | Hidroelektrane u Hrvatskoj | Izvori | Poveznice | Vanjske poveznice | Navigacijski izbornikTechnical Report, Version 2Zajedničkom poslužiteljuHidroelektranaHEP Proizvodnja d.o.o. - Hidroelektrane u Hrvatskoj

            WordPress Information needed

            Oconto (Nebraska) Índice Demografia | Geografia | Localidades na vizinhança | Referências Ligações externas | Menu de navegação41° 8' 29" N 99° 45' 41" O41° 8' 29" N 99° 45' 41" OU.S. Census Bureau. Census 2000 Summary File 1U.S. Census Bureau. Estimativa da população (julho de 2006)U.S. Board on Geographic Names. Topical Gazetteers Populated Places. Gráficos do banco de dados de altitudes dos Estados Unidos da AméricaEstatísticas, mapas e outras informações sobre Oconto em city-data.com