Stat 35b: Introduction to Probability with Applications to Poker

Slides:



Advertisements
Similar presentations
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Savage/Tyler, Kaplan/Gazes 2.P(flop a full house) 3.Bernoulli random.
Advertisements

Lectures prepared by: Elchanan Mossel Yelena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Midterms. 2.Hellmuth/Gold. 3.Poisson. 4.Continuous distributions.
Prof. Bart Selman Module Probability --- Part d)
Stat 321 – Lecture 19 Central Limit Theorem. Reminders HW 6 due tomorrow Exam solutions on-line Today’s office hours: 1-3pm Ch. 5 “reading guide” in Blackboard.
Binomial & Geometric Random Variables
Stat 321- Day 13. Last Time – Binomial vs. Negative Binomial Binomial random variable P(X=x)=C(n,x)p x (1-p) n-x  X = number of successes in n independent.
1 Random Variables and Discrete probability Distributions SESSION 2.
Lectures prepared by: Elchanan Mossel Yelena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
Unit 4 Starters. Starter Suppose a fair coin is tossed 4 times. Find the probability that heads comes up exactly two times.
Stat 13, Thu 5/3/ Correction on normal notation. 2. Normal percentiles. 3. Normal probability plots. 4. Bernoulli and Binomial random variables.
Stat 13, Tue 6/5/ Hand in hw7. 2. Practice problems. Final exam is Thur, 6/7, in class. It has 20 multiple choice questions. Only about 50% are on.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hand in hw4. 2.Review list 3.Tournament 4.Sample problems * Final.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day, Thur 3/8/12: 0.HAND IN HW3 again! 1.E(X+Y) example corrected. 2.Random.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 0. Collect hw2, return hw1, give out hw3. 1.Project A competition.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Midterm. 2.Review of Bernoulli and binomial random variables. 3.Geometric.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.E(cards til 2 nd king). 2.Negative binomial. 3.Rainbow flops examples,
Expected values and variances. Formula For a discrete random variable X and pmf p(X): Expected value: Variance: Alternate formula for variance:  Var(x)=E(X^2)-[E(X)]^2.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Collect Hw4. 2.Review list. 3.Answers to hw4. 4.Project B tournament.
Lectures prepared by: Elchanan Mossel elena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day, Tue 3/13/12: 1.Collect Hw WSOP main event. 3.Review list.
X = 2*Bin(300,1/2) – 300 E[X] = 0 Y = 2*Bin(30,1/2) – 30 E[Y] = 0.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Deal-making and expected value 2.Odds ratios, revisited 3.Variance.
Exam 2: Rules Section 2.1 Bring a cheat sheet. One page 2 sides. Bring a calculator. Bring your book to use the tables in the back.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1. Review list 2.Bayes’ Rule example 3.CLT example 4.Other examples.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day, Tues 2/28/12: 1.Midterms back. 2.Review of midterm. 3.Poisson distribution,
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day, Tue 3/13/12: 1.Fred Savage hand. 2.Random walks, continued, for 7.14.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.E(X+Y) = E(X) + E(Y) examples. 2.CLT examples. 3.Lucky poker. 4.Farha.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Odds ratios revisited. 2.Gold/Hellmuth. 3.Deal making. 4.Variance.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hand in hw1! Get hw2. 2.Combos, permutations, and A  vs 2  after.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Tournaments 2.Review list 3.Random walk and other examples 4.Evaluations.
1)Hand in HW. 2)No class Tuesday (Veteran’s Day) 3)Midterm Thursday (1 page, double-sided, of notes allowed) 4)Review List 5)Review of Discrete variables.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Uniform, normal, and exponential. 2.Exponential example. 3.Uniform.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.HW4 notes. 2.Law of Large Numbers (LLN). 3.Central Limit Theorem.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.PDFs and CDFs, for Random walks, ch 7.6. Reflection principle,
(Day 14 was review. Day 15 was the midterm.) Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Return and review.
Outline: 1) Odds ratios, continued. 2) Expected value revisited, Harrington’s strategy 3) Pot odds 4) Examples.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1. Combos, permutations, and A  vs 2  after first ace 2.Conditional.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Expected value. 2.Heads up with AA. 3.Heads up with Gus vs.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Review List 2.Review of Discrete variables 3.Nguyen / Szenkuti.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Honors Stats 4 Day 10 Chapter 16.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Chapter 5 Statistical Models in Simulation
Stat 35b: Introduction to Probability with Applications to Poker
Chapter 16.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Discrete Distributions
Discrete Distributions
Stat 35b: Introduction to Probability with Applications to Poker
Pull 2 samples of 5 pennies and record both averages (2 dots).
Further Stats 1 Chapter 5 :: Central Limit Theorem
Expected values and variances
Discrete Distributions.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Presentation transcript:

Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: E(X+Y) = E(X) + E(Y). Harman/Negreanu. Running a hand multiple times, expected value and variance. Geometric random variables. Negative binomial random variables. Midterm is Feb 21, in class. 50 min. Open book plus one page of notes, double sided. Bring a calculator!   u    u 

1) E(X+Y) = E(X) + E(Y). pp126-127. A fact given in ch.7 is that E(X+Y) = E(X) + E(Y), for any random variables X and Y, whether X & Y are independent or not, as long as E(X) and E(Y) are finite. Similarly, E(X + Y + Z + …) = E(X) + E(Y) + E(Z) + … And, if X & Y are independent, then V(X+Y) = V(X) + V(Y). so SD(X+Y) = √[SD(X)^2 + SD(Y)^2]. Example 1: Play 10 hands. X = your total number of pocket aces. What is E(X)? X is binomial (n,p) where n=10 and p = 0.00452, so E(X) = np = 0.0452. Alternatively, X = # of pocket aces on hand 1 + # of pocket aces on hand 2 + … So, E(X) = Expected # of AA on hand1 + Expected # of AA on hand2 + … Each term on the right = 1 * 0.00452 + 0 * 0.99548 = 0.00452. So E(X) = 0.00452 + 0.00452 + … + 0.00452 = 0.0452. Example 2: Play 1 hand, against 9 opponents. X = total # of pocket aces at the table. E(X) = ? Note: not independent! If you have AA, then it’s unlikely anyone else does too. Nevertheless, Let X1 = 1 if player #1 has AA, and 0 otherwise. X2 = 1 if player #2 has AA, and 0 otherwise, and so on. Then X = X1 + X2 + … + X10. So E(X) = E(X1) + E(X2) + … + E(X10) = 0.00452 + 0.00452 + … + 0.00452 = 0.0452.

Deal the cards face up, without reshuffling. Let Z = the number of cards til the 2nd king. What is E(Z)? I’ll answer this next time. The solution uses the fact E(X+Y+Z + ...) = E(X) + E(Y) + E(Z) + ....   u    u 

2) Harman and Negreanu, 3) Running a hand multiple times, E(X) and V(X). Farha vs. Antonius too. E(X+Y) = E(X) + E(Y). Whether X & Y are independent or not! And, if X & Y are independent, then V(X+Y) = V(X) + V(Y). so SD(X+Y) = √[SD(X)^2 + SD(Y)^2]. Also, if Y = 9X, then E(Y) = 9E(Y), and SD(Y) = 9SD(X). V(Y) = 81V(X). Farha vs. Antonius. Running it 4 times. Let X = chips you have after the hand. Let p be the prob. you win. X = X1 + X2 + X3 + X4, where X1 = chips won from the first “run”, etc. E(X) = E(X1) + E(X2) + E(X3) + E(X4) = 1/4 pot (p) + 1/4 pot (p) + 1/4 pot (p) + 1/4 pot (p) = pot (p) = same as E(Y), where Y = chips you have after the hand if you ran it once! But the SD is smaller: clearly X1 = Y/4, so SD(X1) = SD(Y)/4. So, V(X1) = V(Y)/16. V(X) ~ V(X1) + V(X2) + V(X3) + V(X4), = 4 V(X1) = 4 V(Y) / 16 = V(Y) / 4. So SD(X) = SD(Y) / 2.

Harman / Negreanu, and running it twice. Harman has 10 7 . Negreanu has K Q . The flop is 10u 7 Ku . Harman’s all-in. $156,100 pot. P(Negreanu wins) = 28.69%. P(Harman wins) = 71.31%. Let X = amount Harman has after the hand. If they run it once, E(X) = $0 x 29% + $156,100 x 71.31% = $111,314.90. If they run it twice, what is E(X)? There’s some probability p1 that Harman wins both times ==> X = $156,100. There’s some probability p2 that they each win one ==> X = $78,050. There’s some probability p3 that Negreanu wins both ==> X = $0. E(X) = $156,100 x p1 + $78,050 x p2 + $0 x p3. If the different runs were independent, then p1 = P(Harman wins 1st run & 2nd run) would = P(Harman wins 1st run) x P(Harman wins 2nd run) = 71.31% x 71.31% ~ 50.85%. But, they’re not quite independent! Very hard to compute p1 and p2. However, you don’t need p1 and p2 ! X = the amount Harman gets from the 1st run + amount she gets from 2nd run, so E(X) = E(amount Harman gets from 1st run) + E(amount she gets from 2nd run) = $78,050 x P(Harman wins 1st run) + $0 x P(Harman loses first run) + $78,050 x P(Harman wins 2nd run) + $0 x P(Harman loses 2nd run) = $78,050 x 71.31% + $0 x 28.69% + $78,050 x 71.31% + $0 x 28.69% = $111,314.90.

HAND RECAP: Harman 10 7 . Negreanu K Q . Flop 10u 7 Ku . Harman’s all-in. $156,100 pot. P(Negreanu wins) = 28.69%.P(Harman wins) = 71.31%. --------------------------------------------------------------------------- The standard deviation (SD) changes a lot! Say they run it once. (see p127.) V(X) = E(X2) - µ2. µ = $111,314.9, so µ2 ~ $12.3 billion. E(X2) = ($156,1002)(71.31%) + (02)(28.69%) = $17.3 billion. V(X) = $17.3 billion - $12.3 bill. = $5.09 billion. SD s = sqrt($5.09 billion)~$71,400. So if they run it once, Harman expects to get back about $111,314.9 +/- $71,400. If they run it twice? Hard to compute, but approximately, if each run were independent, then V(X1+X2) = V(X1) + V(X2), so if X1 = amount she gets back on 1st run, and X2 = amount she gets from 2nd run, then V(X1+X2) ~ V(X1) + V(X2) ~ $1.25 billion + $1.25 billion = $2.5 billion, The standard deviation s = sqrt($2.5 billion) ~ $50,000. So if they run it twice, Harman expects to get back about $111,314.9 +/- $50,000.

4. Geometric Random Variables, ch 5.3. Suppose now X = # of trials until the first occurrence. (Again, each trial is independent, and each time the probability of an occurrence is p.) Then X = Geometric (p). e.g. the number of hands til you get your next pocket pair. [Including the hand where you get the pocket pair. If you get it right away, then X = 1.] Now X could be 1, 2, 3, …, up to ∞. pmf: P(X = k) = p1 qk - 1. e.g. say k=5: P(X = 5) = p1 q 4. Why? Must be 0 0 0 0 1. Prob. = q * q * q * q * p. If X is Geometric (p), then µ = 1/p, and s = (√q) ÷ p. e.g. Suppose X = the number of hands til your next pocket pair. P(X = 12)? E(X)? s? X = Geometric (5.88%). P(X = 12) = p1 q11 = 0.0588 * 0.9412 ^ 11 = 3.02%. E(X) = 1/p = 17.0. s = sqrt(0.9412) / 0.0588 = 16.5. So, you’d typically expect it to take 17 hands til your next pair, +/- around 16.5 hands.