Stat 100a: Introduction to Probability.

Similar documents
Stat 100a: Introduction to Probability. NO CLASS or OH Tue Mar 10. Hw3 is due Mar 12.

I will assign you to teams on Tuesday.

I will assign you to teams on Tuesday.

HW1 is due Thu Oct 12 in the first 5 min of class. Read through chapter 5.

Stat 35: Introduction to Probability. Outline for the day: 1. Hand in HW1. See hw2. 2. Violette and Elezra again. 3. Variance and SD. 4.

Texas Hold em Poker Basic Rules & Strategy

ShortStack StrategY handout

MIT 15.S50 LECTURE 5. Friday, January 27 th, 2012

After receiving his initial two cards, the player has four standard options: he can "Hit," "Stand," "Double Down," or "Split a pair.

STATION 1: ROULETTE. Name of Guesser Tally of Wins Tally of Losses # of Wins #1 #2

Exploitability and Game Theory Optimal Play in Poker

The Independent Chip Model and Risk Aversion

Stat 100a, Introduction to Probability. Rick Paik Schoenberg

Conditional Probabilities and Tree Diagrams. COPYRIGHT 2006 by LAVON B. PAGE

Conditional Distributions

How to Win at Texas Hold Em Poker Errata

Knowing the Odds. Of course, if you are voluntarily entering pots with 8-3 off-suit very often, we should have a broader discussion!

Write out how many ways a player can be dealt AK suited (hereinafter AKs).

Discrete Random Variables Day 1

Eight game mix tournament structure

Texas Hold em Poker Rules

Probability I Sample spaces, outcomes, and events.

Math 10B: Worksheet 4 Solutions

Reflections on the First Man vs. Machine No-Limit Texas Hold 'em Competition

A Brief Introduction to Game Theory

Electronic Wireless Texas Hold em. Owner s Manual and Game Instructions #64260

POKER RESOURCE GUIDE. Poker Math Cheat Sheet. Poker Flash Cards. Top 10 Poker HUD Stats. System for Poker Success Infographic

Darse Billings s No-Limit Hold'em Tournament Primer

Math 106 Lecture 3 Probability - Basic Terms Combinatorics and Probability - 1 Odds, Payoffs Rolling a die (virtually)

Bobby Baldwin, Poker Legend

Massachusetts Institute of Technology 15.S50 Poker Theory and Analytics IAP Case 2

Basic Fixed limit Handout

Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015

ultimate texas hold em 10 J Q K A

Expectation and Thin Value in No-limit Hold em: Profit comes with Variance by Brian Space, Ph.D

Fictitious Play applied on a simplified poker game

Homework 8 (for lectures on 10/14,10/16)

Welcome to the Best of Poker Help File.

To play the game player has to place a bet on the ANTE bet (initial bet). Optionally player can also place a BONUS bet.

How To Crush Online No Limit Holdem

Math 152: Applicable Mathematics and Computing

Live Casino game rules. 1. Live Baccarat. 2. Live Blackjack. 3. Casino Hold'em. 4. Generic Rulette. 5. Three card Poker

Pan (7:30am) Juan (8:30am) Juan (9:30am) Allison (10:30am) Allison (11:30am) Mike L. (12:30pm) Mike C. (1:30pm) Grant (2:30pm)

Small Stakes Hold 'em: Winning Big with Expert Play #Ed Miller, David Sklansky, Mason Malmuth #2004

A Brief Introduction to Game Theory

Table Games Rules. MargaritavilleBossierCity.com FIN CITY GAMBLING PROBLEM? CALL

MIT 15.S50 LECTURE 2. Friday, January 20 th, 2012

Get a FREE 32-Minute Coaching Video! How to Claim Your FREE 32-Minute Coaching Video:

Fall 2017 March 13, Written Homework 4

Poker Rules Friday Night Poker Club

Probability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37

What now? What earth-shattering truth are you about to utter? Sophocles

The Easy to Use Poker Rewards Calculator Manual

EE 126 Fall 2006 Midterm #1 Thursday October 6, 7 8:30pm DO NOT TURN THIS PAGE OVER UNTIL YOU ARE TOLD TO DO SO

Simple Poker Game Design, Simulation, and Probability

Grade 7/8 Math Circles Game Theory October 27/28, 2015

Poker Hand Rankings Highest to Lowest A Poker Hand s Rank determines the winner of the pot!

Red Chip Poker: Late Position. Written by Doug Hull, James Sweeney, Christian Soto

Checkpoint Questions Due Monday, October 7 at 2:15 PM Remaining Questions Due Friday, October 11 at 2:15 PM

PHASE 10 CARD GAME Copyright 1982 by Kenneth R. Johnson

Math 4610, Problems to be Worked in Class

Probability: Anticipating Patterns

Take one! Rules: Two players take turns taking away 1 chip at a time from a pile of chips. The player who takes the last chip wins.

Probability & Expectation. Professor Kevin Gold

The Teachers Circle Mar. 20, 2012 HOW TO GAMBLE IF YOU MUST (I ll bet you $5 that if you give me $10, I ll give you $20.)

Probability and Statistical Theory

Analysis For Hold'em 3 Bonus April 9, 2014

Get a FREE 32-Minute Coaching Video! How to Claim Your FREE 32-Minute Coaching Video:

INTRODUCTORY STATISTICS LECTURE 4 PROBABILITY

Make better decisions. Learn the rules of the game before you play.

Best of luck on the exam!

Math 147 Lecture Notes: Lecture 21


"Official" Texas Holdem Rules

Game 0: One Pile, Last Chip Loses

Welcome to the Casino Collection Help File.

- MATHEMATICS AND COMPUTER EDUCATION-

NUMB3RS Activity: A Bit of Basic Blackjack. Episode: Double Down

What is Bet the Flop?

Classical Definition of Probability Relative Frequency Definition of Probability Some properties of Probability

Hold em Project. 1 Overview. Due Wed. Dec. 7

NewPokerSoft. Program to calculate Texas Holdem combinations

Design for Fundraisers

Some Unusual Applications of Math

"Students play games while learning the connection between these games and Game Theory in computer science or Rock-Paper-Scissors and Poker what s

Statistics Intermediate Probability

ELKS TOWER CASINO and LOUNGE TEXAS HOLD'EM POKER

Comp 3211 Final Project - Poker AI

Senior Math Circles February 10, 2010 Game Theory II

Basics of Five Card Draw

1. Simplify 5! 2. Simplify P(4,3) 3. Simplify C(8,5) ? 6. Simplify 5

Simultaneous-Move Games: Mixed Strategies. Games Of Strategy Chapter 7 Dixit, Skeath, and Reiley

Chapter 1. Probability

Stat Summer 2012 Exam 1. Your Name:

MATHEMATICS E-102, FALL 2005 SETS, COUNTING, AND PROBABILITY Outline #1 (Probability, Intuition, and Axioms)

Stat 20: Intro to Probability and Statistics

6. a) Determine the probability distribution. b) Determine the expected sum of two dice. c) Repeat parts a) and b) for the sum of

Introduction to Auction Theory: Or How it Sometimes

Phase 10 Masters Edition Copyright 2000 Kenneth R. Johnson For 2 to 4 Players

POKER. May 31, June 2 & 9, 2016

Transcription:

Stat 100a: Introduction to Probability. Outline for the day 0. Quick facts about normals. 1. Chip proportions and induction. 2. Doubling up. 3. Examples. 0. If X and Y are independent and both are normal, then X+Y is normal, and so are X and Y. The computer project is due on Sat Dec2 8:00pm. HW3 is due Tue Dec 5. Thu Dec 7 is the final exam, here in class, 11am to 12:15pm. Again any notes and books are fine, and bring a pencil and a calculator. Also bring your student ID to the exam.

1. Chip proportions and induction, Theorem 7.6.6. P(win a tournament) is proportional to your number of chips. Simplified scenario. Suppose you either go up or down 1 each hand, with prob. 1/2. Suppose there are n chips, and you have k of them. Let p k = P(win tournament given k chips) = P(random walk goes k -> n before hitting 0). Now, clearly p 0 = 0. Consider p 1. From 1, you will either go to 0 or 2. So, p 1 = 1/2 p 0 + 1/2 p 2 = 1/2 p 2. That is, p 2 = 2 p 1. We have shown that p j = j p 1, for j = 0, 1, and 2. (induction:) Suppose that, for j = 0, 1, 2,, m, p j = j p 1. We will show that p m+1 = (m+1) p 1. Therefore, p j = j p 1 for all j. That is, P(win the tournament) is prop. to your number of chips. p m = 1/2 p m-1 + 1/2 p m+1. If p j = j p 1 for j m, then we have mp 1 = 1/2 (m-1)p 1 + 1/2 p m+1, so p m+1 = 2mp 1 - (m-1) p 1 = (m+1)p 1.

2. Doubling up. Again, P(winning) = your proportion of chips. Theorem 7.6.7, p152, describes another simplified scenario. Suppose you either double each hand you play, or go to zero, each with probability 1/2. Again, P(win a tournament) is prop. to your number of chips. Again, p 0 = 0, and p 1 = 1/2 p 2 = 1/2 p 2, so again, p 2 = 2 p 1. We have shown that, for j = 0, 1, and 2, p j = j p 1. (induction:) Suppose that, for j m, p j = j p 1. We will show that p 2m = (2m) p 1. Therefore, p j = j p 1 for all j = 2 k. That is, P(win the tournament) is prop. to # of chips. This time, p m = 1/2 p 0 + 1/2 p 2m. If p j = j p 1 for j m, then we have mp 1 = 0 + 1/2 p 2m, so p 2m = 2mp 1. Done. In Theorem 7.6.8, p152, you have k of the n chips in play. Each hand, you gain 1 with prob. p, or lose 1 with prob. q=1-p. Suppose 0<p <1 and p 0.5. Let r = q/p. Then P(you win the tournament) = (1-r k )/(1-r n ). The proof is again by induction, and is similar to the proof we did of Theorem 7.6.6.

3. Examples. (Chen and Ankenman, 2006). Suppose that a $100 winner-take-all tournament has 1024 = 2 10 players. So, you need to double up 10 times to win. Winner gets $102,400. Suppose you have probability p = 0.54 to double up, instead of 0.5. What is your expected profit in the tournament? (Assume only doubling up.) Answer. P(winning) = 0.54 10, so exp. return = 0.54 10 ($102,400) = $215.89. So exp. profit = $115.89. What if each player starts with 10 chips, and you gain a chip with p = 54% and lose a chip with p = 46%? What is your expected profit? Answer. r = q/p =.46/.54 =.852. P(you win) = (1-r 10 )/(1-r 10240 ) = 79.9%. So exp. profit =.799($102400) - $100 ~ $81700.

Random Walk example. Suppose you start with 1 chip at time 0 and that your tournament is like a simple random walk, but if you hit 0 you are done. P(you have not hit zero by time 47)? We know that starting at 0, P(Y 1 0, Y 2 0,, Y 2n 0) = P(Y 2n = 0). So, P(Y 1 > 0, Y 2 > 0,, Y 48 > 0) = ½ P(Y 48 = 0) = ½ Choose(48,24)(½) 48 = P(Y 1 = 1, Y 2 > 0,, Y 48 > 0) = P(start at 0 and win your first hand, and then stay above 0 for at least 47 more hands) = P(start at 0 and win your first hand) x P(from (1,1), stay above 0 for 47 more hands) = 1/2 P(starting with 1 chip, stay above 0 for at least 47 more hands). So, P(starting with 1 chip, stay above 0 for at least 47 hands) = Choose(48,24)(½) 48 = 11.46%.

Bayes rule example. Your opponent raises all-in before the flop. Suppose you think she would do that 80% of the time with AA, KK, or QQ, and she would do that 30% of the time with AK or AQ, and 1% of the time with anything else. Given only this, and not even your cards, what s P(she has AK)? Given nothing, P(AK) = 16/C(52,2) = 16/1326. P(AA) = C(4,2)/C(52,2) = 6/1326. Using Bayes rule, P(AK all-in) =. P(all-in AK) * P(AK), P(all-in AK)P(AK) + P(all-in AA)P(AA) + P(all-in KK)P(KK) + =. 30% x 16/1326. [30%x16/1326] + [80%x6/1326] + [80%x6/1326] + [80%x6/1326] + [30%x16/1326] + [1% (1326-16-6-6-6-16)/1326)] (AK) (AA) (KK) (QQ) (AQ) (anything else) = 13.06%. Compare with 16/1326 ~ 1.21%.

Conditional probability examples. Approximate P(SOMEONE has AA, given you have KK)? Out of your 8 opponents? Note that given that you have KK, P(player 2 has AA & player 3 has AA) = P(player 2 has AA) x P(player 3 has AA player 2 has AA) = choose(4,2) / choose(50,2) x 1/choose(48,2) = 0.0000043, or 1 in 230,000. So, very little overlap! Given you have KK, P(someone has AA) = P(player2 has AA or player3 has AA or or pl.9 has AA) ~ P(player2 has AA) + P(player3 has AA) + + P(player9 has AA) = 8 x choose(4,2) / choose(50,2) = 3.9%, or 1 in 26. ----------- What is exactly P(someone has an Ace you have KK)? (8 opponents) or more than one ace Given that you have KK, P(someone has an Ace) = 100% - P(nobody has an Ace). And P(nobody has an Ace) = choose(46,16)/choose(50,16) = 20.1%. So P(someone has an Ace) = 79.9%.

Some other example problems. a. Find the probability you are dealt a suited king. 4 * 12 / C(52,2) = 3.62%. b. The typical number of hands until this occurs is... +/-... 1/.0362 ~ 27.6. ( 96.38%) / 3.62% ~ 27.1. So the answer is 27.6 +/- 27.1.

More on luck and skill. Gain due to skill on a betting round = your expected profit during the betting round = your exp. chips after betting round your exp. chips before betting round = (equity after round + leftover chips) (equity before round + leftover chips + chips you put in during round) = equity after round equity before round cost during round. For example, suppose you have A A, I have 3 3, the board is A Q 10 and there is $10 in the pot. The turn is 3 You go all in for $5 and I call. How much equity due to skill did you gain on the turn? Your prob. of winning is 43/44. Your skill gain on turn = your equity after turn bets - equity before turn bets cost = ($20)(43/44) - ($10)(43/44) - $5 = $4.77. Suppose instead you bet $5 on the turn and I folded. How much equity due to skill did you gain on the turn? $15(100%) - ($10)(43/44) - $5 = $0.23.

P(You have AK you have exactly one ace)? = P(You have AK and exactly one ace) / P(exactly one ace) = P(AK) / P(exactly one ace) P(A B) = P(AB)/P(B). = (16/C(52,2)) (4x48/C(52,2)) = 4/48 = 8.33%. P(You have AK you have at least one ace)? = P(You have AK and at least one ace) / P(at least one ace) = P(AK) / P(at least one ace) = (16/C(52,2)) (((4x48 + C(4,2))/C(52,2)) ~ 8.08%. P(You have AK your FIRST card is an ace)? = 4/51 = 7.84%.

Suppose there are 1000 players in a casino. Each of them is playing holdem. What is the expected number of people who have pocket aces? Let X 1 = 1 if player 1 has pocket aces, and 0 otherwise. X 2 = 1 if player 2 has pocket aces, and 0 otherwise. X 3 = 1 if player 3 has pocket aces, and 0 otherwise, etc. X 1 and X 2 are not independent. Nevertheless, if Y = the number of people with AA, then Y = X 1 + X 2 +... + X 1000, and E(Y) = E(X 1 ) + E(X 2 ) +... + E(X 1000 ) = C(4,2)/C(52,2) x 1000 ~ 4.52.

Let X = the number of aces you have and Y = the number of kings you have. What is cov(x,y)? cov(x,y) = E(XY) E(X)E(Y). X = X 1 + X 2, where X 1 = 1 if your first card is an ace and X 2 = 1 if your 2 nd card is an ace, so E(X) = E(X 1 ) + E(X 2 ) = 1/13 + 1/13 = 2/13. E(Y) = 2/13. E(XY) = 1 if you have AK, and 0 otherwise, so E(XY) = 1 x P(AK) = 4x4/C(52,2) =.0121. So, cov(x,y) =.0121 2/13 x 2/13 = -.0116.

Another CLT Example Suppose X1, X2,..., X100 are 100 iid draws from a population with mean µ=70 and sd s=10. What is the approximate distribution of the sample mean, x? By the CLT, the sample mean is approximately normal with mean µ and sd s/ n, i.e. ~ N(70, 1 2 ). Now suppose Y1, Y2,..., Y100 are iid draws, independent of X1, X2, X100, with mean µ=80 and sd s=25. What is the approximate distribution of x - y = Z? Now the sample mean of the first sample is approximately N(70, 1 2 ) and similarly the negative sample mean of the 2 nd sample is approximately N(-80, 2.5 2 ), and the two are independent, so their sum Z is approximately normal. Its mean is 70-80 = -10, and var(z) = 1 2 +2.5 2 = 7.25, so Z ~ N(-10, 2.69 2 ), because 2.69 2 = 7.25. Remember, if X and Y are ind., then var(x+y) = var(x) + var(y).