Stat 35b: Introduction to Probability with Applications to Poker

Slides:



Advertisements
Similar presentations
 1  Outline  terminating and non-terminating systems  theories for output analysis  Strong Law of Large Numbers  Central Limit Theorem  Regenerative.
Advertisements

Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Midterms. 2.Hellmuth/Gold. 3.Poisson. 4.Continuous distributions.
Objectives Look at Central Limit Theorem Sampling distribution of the mean.
4. Convergence of random variables  Convergence in probability  Convergence in distribution  Convergence in quadratic mean  Properties  The law of.
Stat 321 – Day 22 Confidence intervals cont.. Reminders Exam 2  Average .79 Communication, binomial within binomial  Course avg >.80  Final exam 20-25%
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.
Standard error of estimate & Confidence interval.
Stat 13, Thu 5/10/ CLT again. 2. CIs. 3. Interpretation of a CI. 4. Examples. 5. Margin of error and sample size. 6. CIs using the t table. 7. When.
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.
1 Outline 1.Review of last week 2.Sampling distributions 3.The sampling distribution of the mean 4.The Central Limit Theorem 5.Confidence intervals 6.Normal.
Stat 13, Tue 5/8/ Collect HW Central limit theorem. 3. CLT for 0-1 events. 4. Examples. 5.  versus  /√n. 6. Assumptions. Read ch. 5 and 6.
Vegas Baby A trip to Vegas is just a sample of a random variable (i.e. 100 card games, 100 slot plays or 100 video poker games) Which is more likely? Win.
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.
Stat 13, Tue 5/15/ Hand in HW5 2. Review list. 3. Assumptions and CLT again. 4. Examples. Hand in Hw5. Midterm 2 is Thur, 5/17. Hw6 is due Thu, 5/24.
Rule of sample proportions IF:1.There is a population proportion of interest 2.We have a random sample from the population 3.The sample is large enough.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hand in hw3. 2.Review of midterm. 3.Project B functions and example.
MA-250 Probability and Statistics Nazar Khan PUCIT Lecture 26.
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.
STA Lecture 181 STA 291 Lecture 18 Exam II Next Tuesday 5-7pm Memorial Hall (Same place) Makeup Exam 7:15pm – 9:15pm Location TBA.
Determination of Sample Size: A Review of Statistical Theory
Stat 13, Tue 5/1/ Midterm Expected value, lotto and roulette. 3. Normal calculations. Read ch4. Hw4 is due Tue, 5/8, and Midterm 2 is Thur,
1 BA 275 Quantitative Business Methods Quiz #2 Sampling Distribution of a Statistic Statistical Inference: Confidence Interval Estimation Introduction.
Stat 35b: Introduction to Probability with Applications to Poker Poker Code competition: all-in or fold.   u 
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.
Review Normal Distributions –Draw a picture. –Convert to standard normal (if necessary) –Use the binomial tables to look up the value. –In the case of.
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.
Expected value (µ) = ∑ y P(y) Sample mean (X) = ∑X i / n Sample standard deviation = √[∑(X i - X) 2 / (n-1)] iid: independent and identically distributed.
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.Tournaments 2.Review list 3.Random walk and other examples 4.Evaluations.
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.
Central Limit Theorem Let X 1, X 2, …, X n be n independent, identically distributed random variables with mean  and standard deviation . For large n:
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.
Sums of Random Variables and Long-Term Averages Sums of R.V. ‘s S n = X 1 + X X n of course.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Review List 2.Review of Discrete variables 3.Nguyen / Szenkuti.
R. Kass/W04 P416 Lec 3 1 Lecture 3 The Gaussian Probability Distribution Function Plot of Gaussian pdf x p(x)p(x) Introduction l The Gaussian probability.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Supplemental Lecture Notes
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 31, Section 1, Last Time Sampling Distributions
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Chapter 5 Joint Probability Distributions and Random Samples
The Gaussian Probability Distribution Function
Stat 35b: Introduction to Probability with Applications to Poker
Sample Mean Distributions
Stat 35b: Introduction to Probability with Applications to Poker
Econ Roadmap Focus Midterm 1 Focus Midterm 2 Focus Final Intro
Statistics in Applied Science and Technology
Stat 35b: Introduction to Probability with Applications to Poker
Data Analysis and Statistical Software I ( ) Quarter: Autumn 02/03
ASV Chapters 1 - Sample Spaces and Probabilities
Using the Tables for the standard normal distribution
Lecture 34 Section 7.5 Wed, Mar 24, 2004
Welcome Back Please hand in your homework.
Stat 35b: Introduction to Probability with Applications to Poker
Standard undergrad probability course, not a poker strategy guide nor an endorsement of gambling. The usual undergrad topics + random walks, luck and skill,
Stat Lab 9.
Stat 35b: Introduction to Probability with Applications to Poker
Stat 35b: Introduction to Probability with Applications to Poker
Interval Estimation Download this presentation.
Stat 35b: Introduction to Probability with Applications to Poker
Mar. 24 Statistic for the day: The number of heartbeats in a lifetime for any animal (mouse to elephant): Approximately 1 billion Assignment: Read Chapter.
How Confident Are You?.
Presentation transcript:

Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: Return hw3 and midterms. Conditional expectation. Law of Large Numbers (LLN). Central Limit Theorem (CLT). Confidence intervals for µ. Homework 4, Stat 35, due Thu March 14, 11 am. 6.12, 7.2, 7.8, 7.14. Project B is due Tue, Mar. 12, 8pm, by email to frederic@stat.ucla.edu. Read ch7. Also, read pages 109-113 on optimal play, though it’s not on the final. If you want examples and descriptions of the arguments to your function, see projectBexamples.txt on the course website, http://www.stat.ucla.edu/~frederic/35/W13

2. Conditional expectation, E(Y | X), ch. 7.2. Suppose X and Y are discrete. Then E(Y | X=j) is defined as ∑k k P(Y = k | X = j), just as you’d think. E(Y | X) is a random variable such that E(Y | X) = E(Y | X=j) whenever X = j. For example, let X = the # of spades in your hand, and Y = the # of clubs in your hand. a) What’s E(Y)? b) What’s E(Y|X)? c) What’s P(E(Y|X) = 1/3)? a. E(Y) = 0P(Y=0) + 1P(Y=1) + 2P(Y=2) = 0 + 13x39/C(52,2) + 2 C(13,2)/C(52,2) = 0.5. b. X is either 0, 1, or 2. If X = 0, then E(Y|X) = E(Y | X=0) and E(Y | X=0) = 0 P(Y=0 | X=0) + 1 P(Y=1 | X=0) + 2 P(Y=2 | X = 0) = 0 + 13x26/C(39,2) + 2 C(13,2) / C(39,2) = 2/3. E(Y | X=1) = 0 P(Y=0 | X=1) + 1 P(Y=1 | X=1) + 2 P(Y=2 | X = 1) = 0 + 13/39 + 2 (0) = 1/3. E(Y | X=2) = 0 P(Y=0 | X=2) + 1 P(Y=1 | X=2) + 2 P(Y=2 | X = 2) = 0 + 1 (0) + 2(0) = 0. So E(Y | X = 0) = 2/3, E(Y | X = 1) = 1/3, and E(Y | X = 2) = 0. That’s what E(Y|X) is c. P(E(Y|X) = 1/3) is just P(X=1) = 13x39/C(52,2) ~ 38.24%.

3. Law of Large Numbers (LLN) and the Fundamental Theorem of Poker, ch 7.3. David Sklansky, The Theory of Poker, 1987. “Every time you play a hand differently from the way you would have played it if you could see all your opponents’ cards, they gain; and every time you play your hand the same way you would have played it if you could see all their cards, they lose. Conversely, every time opponents play their hands differently from the way they would have if they could see all your cards, you gain; and every time they play their hands the same way they would have played if they could see all your cards, you lose.” Meaning? LLN: If X1, X2 , etc. are iid with expected value µ and sd s, then Xn ---> µ. Any short term good or bad luck will ultimately become negligible to the sample mean. However, this does not mean that good luck and bad luck will ultimately cancel out. See p132.

4) Central Limit Theorem (CLT), ch 7.4. Sample mean (Xn) = ∑Xi / n iid: independent and identically distributed. Suppose X1, X2 , etc. are iid with expected value µ and sd s , LAW OF LARGE NUMBERS (LLN): Xn ---> µ . CENTRAL LIMIT THEOREM (CLT): (Xn - µ) ÷ (s/√n) ---> Standard Normal. Useful for tracking results.

95% between -1.96 and 1.96

Truth: -49 to 51, exp. value µ = 1.0 Truth: -49 or 51, each with prob. 1/2. exp. value = 1.0

Truth: uniform on -49 to 51. µ = 1.0 Estimated using Xn +/- 1.96 s/√n = .95 +/- 0.28 in this example

* Poker has high standard deviation. Important to keep track of results. * Don’t just track ∑Xi. Track Xn +/- 1.96 s/√n . Make sure it’s converging to something positive.

(Xn - µ) ÷ (s/√n) ---> Standard Normal. (mean 0, SD 1). Central Limit Theorem (CLT): if X1 , X2 …, Xn are iid with mean µ& SD s, then (Xn - µ) ÷ (s/√n) ---> Standard Normal. (mean 0, SD 1). In other words, Xn has mean µ and a standard deviation of s÷√n. Two interesting things about this: (i) As n --> ∞. Xn --> normal. Even if Xi are far from normal. e.g. average number of pairs per hand, out of n hands. Xi are 0-1 (Bernoulli). µ = p = P(pair) = 3/51 = 5.88%. s = √(pq) = √(5.88% x 94.12%) = 23.525%. (ii) We can use this to find a range were Xn is likely to be. About 95% of the time, a std normal random variable is within -1.96 to +1.96. So 95% of the time, (Xn - µ) ÷ (s/√n) is within -1/96 to +1.96. So 95% of the time, (Xn - µ) is within -1.96 (s/√n) to +1.96 (s/√n). So 95% of the time, Xn is within µ - 1.96 (s/√n) to µ + 1.96 (s/√n). That is, 95% of the time, Xn is in the interval µ +/- 1.96 (s/√n). = 5.88% +/- 1.96(23.525%/√n). For n = 1000, this is 5.88% +/- 1.458%. For n = 1,000,000 get 5.88% +/- 0.0461%.

(Xn - µ) ÷ (s/√n) ---> Standard Normal. (mean 0, SD 1). Another CLT Example Central Limit Theorem (CLT): if X1 , X2 …, Xn are iid with mean µ& SD s, then (Xn - µ) ÷ (s/√n) ---> Standard Normal. (mean 0, SD 1). In other words, Xn is like a draw from a normal distribution with mean µ and standard deviation of s÷√n. That is, 95% of the time, Xn is in the interval µ +/- 1.96 (s/√n). Suppose you average $5 profit per hour, with a SD of $60 per hour. If you play 1600 hours, let Y be your average profit over those 1600 hours. What is range where Y is 95% likely to fall? A. We want µ +/- 1.96 (s/√n), where µ = $5, s = $60, and n=1600. So the answer is $5 +/- 1.96 x $60 / √(1600) = $5 +/- $2.94, or the range [$2.06, $7.94].

(Xn - µ) ÷ (s/√n) ---> Standard Normal. (mean 0, SD 1). 5. Confidence intervals (Cis) for µ, ch 7.5. Central Limit Theorem (CLT): if X1 , X2 …, Xn are iid with mean µ& SD s, then (Xn - µ) ÷ (s/√n) ---> Standard Normal. (mean 0, SD 1). So, 95% of the time, Xn is in the interval µ +/- 1.96 (s/√n). Typically you know Xn but not µ. Turning the blue statement above around a bit means that 95% of the time, µ is in the interval Xn +/- 1.96 (s/√n). This range Xn +/- 1.96 (s/√n) is called a 95% confidence interval (CI) for µ. [Usually you don’t know s and have to estimate it using the sample std deviation, s, of your data, and (Xn - µ) ÷ (s/√n) has a tn-1 distribution if the Xi are normal. For n>30, tn-1 is so similar to normal though.] 1.96 (s/√n) is called the margin of error. Example. Dwan vs. Antonius.

The range Xn +/- 1. 96 (s/√n) is a 95% confidence interval for µ. 1 The range Xn +/- 1.96 (s/√n) is a 95% confidence interval for µ. 1.96 (s/√n) (from fulltiltpoker.com:) Based on these data, can we conclude that Dwan is the better player? Is his longterm avg. µ > 0? Over these 39,000 hands, Dwan profited $2 million. $51/hand. sd ~ $10,000. 95% CI for µ is $51 +/- 1.96 ($10,000 /√39,000) = $51 +/- $99 = (-$48, $150). Results are inconclusive, even after 39,000 hands! How many more hands are needed? If Dwan keeps winning $51/hand, then we want n so that the margin of error = $51. 1.96 (s/√n) = $51 means 1.96 ($10,000) / √n = $51, so n = [(1.96)($10,000)/($51)]2 ~ 148,000, so about 109,000 more hands.