Lecture 13. Poker Two basic concepts: Poker is a game of skill, not luck. If you want to win at poker, – make sure you are very skilled at the game, and.

Slides:



Advertisements
Similar presentations
How to win at poker using game theory A review of the key papers in this field.
Advertisements

Math and Card Games By: Candace DiBiano.
SOCiable A Game of Life Chances ©Jon Witt Version 1.0.
ON THE BOREL AND VON NEUMANN POKER MODELS. Comparison with Real Poker  Real Poker:  Around 2.6 million possible hands for 5 card stud  Hands somewhat.
Reaching Agreements II. 2 What utility does a deal give an agent? Given encounter  T 1,T 2  in task domain  T,{1,2},c  We define the utility of a.
NON - zero sum games.
Name: Trương Hoài Anh Facebook: Quasar Hoaianh
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Introduction to Game theory Presented by: George Fortetsanakis.
Congestion Games with Player- Specific Payoff Functions Igal Milchtaich, Department of Mathematics, The Hebrew University of Jerusalem, 1993 Presentation.
Two-Player Zero-Sum Games
Randomized Strategies and Temporal Difference Learning in Poker Michael Oder April 4, 2002 Advisor: Dr. David Mutchler.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
1. 2 APPENDIX B A PROCEDURE FOR GENERATING AN EQUILIBRIUM POINT FOR 2-PERSON GAMES (That sometimes works!)
Part 3: The Minimax Theorem
Card Counting What is it, how does it work, and can I use it to pay for college? (and if it does work, do I even have to go to college?) Jeff O’Connell.
Final Specification KwangMonarchIkhanJamesGraham.
Mathematics and the Game of Poker
EC102: Class 9 Christina Ammon.
Matrix Games Mahesh Arumugam Borzoo Bonakdarpour Ali Ebnenasir CSE 960: Selected Topics in Algorithms and Complexity Instructor: Dr. Torng.
1 Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
Lectures in Microeconomics-Charles W. Upton Minimax Strategies.
Using Probabilistic Knowledge And Simulation To Play Poker (Darse Billings …) Presented by Brett Borghetti 7 Jan 2007.
Introduction to Cognition and Gaming 9/22/02: Bluffing.
Games of Chance Introduction to Artificial Intelligence COS302 Michael L. Littman Fall 2001.
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
PROBLEM 4.
Some Definitions –Maxi-min (mini-max) strategy: The maxi-min strategy is the path with the highest possible (maximum) worst (minimum) outcome. –Dominant.
Minimax Strategies. Everyone who has studied a game like poker knows the importance of mixing strategies. –With a bad hand, you often fold –But you must.
Game Theory Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.
Introduction to the Big Stack Strategy (BSS) Strategy: No Limit.
Great Theoretical Ideas in Computer Science.
Game Theory.
Online Poker James Gilman. Topics ●Hand Probabilities ●Betting Odds ●Odds of winning ●Expected Value ●Decision Making ●Poker Statistics ●Variance.
Blackjack: An Analysis of Probability By: John Theobald.
Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)
Prime Time 1.2: Playing to Win the Factor Game
Games People Play. 4. Mixed strategies In this section we shall learn How to not lose a game when it appears your opponent has a counter to all your moves.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Poker. Basic card terminology Suits: Hearts, diamonds, clubs, spades Deuce, face cards.
Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
The challenge of poker NDHU CSIE AI Lab 羅仲耘. 2004/11/04the challenge of poker2 Outline Introduction Texas Hold’em rules Poki’s architecture Betting Strategy.
Poker as a Testbed for Machine Intelligence Research By Darse Billings, Dennis Papp, Jonathan Schaeffer, Duane Szafron Presented By:- Debraj Manna Gada.
Part 3 Linear Programming
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Expected value and pot odds, continued 2.Violette/Elezra example.
GamblingGambling What are the odds? Jessica Judd.
Introduction to Poker Originally created by Albert Wu,
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 1 A Quick Review of Game Theory and, in particular, Bayesian Games.
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.
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture 13.
Game Theory Just last week:
Great Theoretical Ideas in Computer Science
Strategies for Poker AI player
Lecture 12.
Stat 35b: Introduction to Probability with Applications to Poker
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Stat 35b: Introduction to Probability with Applications to Poker
Presentation transcript:

Lecture 13

Poker Two basic concepts: Poker is a game of skill, not luck. If you want to win at poker, – make sure you are very skilled at the game, and – always play with somebody worse than you (and who doesn’t cheat)

Baby poker There are 2 players, Player A and Player B. The deck consists of only 3 cards, (J, Q, and K). The players begin by putting $1 into the pot. Each player is then dealt 1 card (one card is left in the deck)

Baby poker Player A goes first. – He either opens by putting $1 into the pot, – or passes by not betting.

Baby poker Player B then plays. – If Player A passed, Player B may also open by putting $1 into the pot, or pass – If Player A opened, then Player B must either call by also putting $1 into the pot, or fold. If player B opened, then Player A (who passed the first time) must either call Player B or fold.

Baby poker This ends the play. If either player folds, then the other player gets everything that was put into the pot to that point. If neither player folds, then the players com- pare cards. The player with the highest card gets everything in the pot.

Ploys Bluffing: Opening on a losing hand (in this case a J). Sandbagging: Passing on a winning hand (in this case a K).

Game play First need to describe strategy for the entire game – This is a list of what the player would do in all possible situations Player actions for Player A – O: open initially (no further decisions for A) – PC: pass initially, then call if B opened – PF: pass initially, then fold if B opened

strategies Player actions for Player B – O/C: open if Player A passes and call if Player A opens – O/F: open if Player A passes and fold if Player A opens – P/C: pass if Player A passes and call if Player A opens – P/F: pass if Player A passes and fold if Player A opens

Using Strategies Each of these decisions must be made based only on the value of the card seen by the respective player. Thus the above strategies must occur in triples, indicating what specific plays must be made upon being dealt J, Q, or K.

“Pure” strategies Possible Player A strategy (P-F,P-C,O) – Pass then fold if J – Pass then call if Q – Open if K Possible Player B strategy (P/F, O/F,O/C) – Pass or fold if J – Open or fold if Q – Open or call if K

Ploys The bluffing strategies are the ones where an O appears in the 1 slot. The sandbagging strategies are the ones where a P appears in the 3 slot. Example: – Strategy (O,P − C,P − C) for player A is both bluffing and sandbagging – Strategy (O/F, P/C, O/C) for B is bluffing (sandbagging is ineffectual for B in this simple game)

Probabilistic strategies Probabilistic mixture of pure strategies. Example Player A: – (P-F,P-F,P-C) with probability 1/3 – (P-F,P-C,O) with probability 1/3 – (O,P-F,P-C) with probability 1/3 Might be useful to bluff/sandbag sometimes but not all the time!

Assessing Strategies The outcome of a particular round of poker depends upon – the strategies chosen by each of the players, – and the cards dealt to each of the players (this component is random) Example: Strategies (P-F,P-C,O) vs (P/F, O/F,O/C) Cards dealt Q vs K – Game will develop as Pass, Open, Call – The pot will be $4 at the end, noone folded B wins $2, equivalently A wins -$2

Expected gain Cards are random; given both strategies we can compute expected gain for player A Example: Strategies (P-F,P-C,O) vs (P/F, O/F,O/C) – Expected gain for A = -$1/6 cards(J, Q)(J, K)(Q, J)(Q, K)(K, J)(K, Q) probability1/6 A gains

Abbreviated Game matrix We removed obviously bad strategies to fit on the page.

Recall maximin Select a strategy S – Here a probabilistic mixture of pure strategies If the opponent knew my strategy, what is the worst they can do to me? – This will be one of the pure strategies (Why?) Select the probabilistic strategy that maximizes this worst case scenario

Optimal strategies Player A: Play (P-F,P-F,P-C) with probability 1/3 (P-F,P-C,O) with probability 1/2 (O,P-F,P-C) with probability 1/6 In layman’s terms : holding a 1: open 1/6 of the time, and pass and fold 5/6 of the time holding a 2: always pass initially, and then call 1/2 of the time and fold the other 1/2 holding a 3: open 1/2 of the time and pass and call the other 1/2.

Optimal strategies Player B: Play (P/F,P/F,O/C) with probability 2/3 (O/F,P/C,O/C) with probability 1/3 In layman’s terms holding a 1: always fold if B opens, but open 1/3 of the time, and pass 2/3 of the time if A passes. holding a 2: always pass if A passes, but call 1/3 of the time and fold 2/3 of the time if A opens holding a 3: always open or call. – Optimal strategy is not unique! Can you find another one?

Value of game In Nash Equilibrium – Value of game: -1/18, i.e. Player A loses $1/18 per game to player B.

``Reward’’ for being honest If Player A cannot bluff or sandbag: – Value of game is -1/9: Player A now loses $1/9 to Player B If Player B cannot bluff: – Value of game is 1/18: Player B now loses $1/18 to Player A If neither player can bluff or sandbag: – Value of game is 0: it is an even game (and a pretty boring one; both players always open with a K and pass-fold with a J or Q).