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)

Slides:



Advertisements
Similar presentations
What are your Chances? by Laurie Townsend.
Advertisements

Game Theory S-1.
15 THEORY OF GAMES CHAPTER.
AE1APS Algorithmic Problem Solving John Drake.  Invariants – Chapter 2  River Crossing – Chapter 3  Logic Puzzles – Chapter 5  Matchstick Games -
1 Copyright © Cengage Learning. All rights reserved. 4 Probability.
6-1 Stats Unit 6 Sampling Distributions and Statistical Inference - 1 FPP Chapters 16-18, 20-21, 23 The Law of Averages (Ch 16) Box Models (Ch 16) Sampling.
GrowingKnowing.com © Binomial probabilities Your choice is between success and failure You toss a coin and want it to come up tails Tails is success,
Part 3: The Minimax Theorem
Lecture 10. Simplified roulette European roulette has numbers 0,1,…36. xD0s
Module 3 Chess 101 Strategy Strategy refers to an overall plan to achieve a goal In every game you play your goal should be to checkmate your opponent,
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.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 15 Chances, Probabilities, and Odds 15.1Random Experiments and.
Excursions in Modern Mathematics Sixth Edition
1 Probability Part 1 – Definitions * Event * Probability * Union * Intersection * Complement Part 2 – Rules Part 1 – Definitions * Event * Probability.
Lecture 4 on Individual Optimization Risk Aversion
1 Many people debate basic questions of chance in games such as lotteries. The Monty Hall problem is a fun brain teaser that Marilyn vos Savant addressed.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
Lectures in Microeconomics-Charles W. Upton Minimax Strategies.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Game Theory.
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.
The game of Barcelona databases, evolution, and reverse tessellation through the eyes of a gambler Keith Clay GRCC.
Probabilities of common Games How do I avoid bad bets?
MAKE A MODEL AND CONDUCT A SIMULATION We design a model and simulate solutions to problems where an exact answer can only be estimated and probability.
GAMES AGAINST NATURE Topic #3. Games Against Nature In game theory, for reasons that will be explained later, the alternatives (e.g., LEFT and RIGHT)
The Marriage Problem Finding an Optimal Stopping Procedure.
COMP14112: Artificial Intelligence Fundamentals L ecture 3 - Foundations of Probabilistic Reasoning Lecturer: Xiao-Jun Zeng
1 9/8/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Bell Work. Have you ever watched someone win a game again and again? Do you think that person just has good luck? In many cases, winners have strategies.
1 Introduction to Discrete Probability Rosen, Section 6.1 Based on slides by Aaron Bloomfield and …
1 9/23/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Games of Strategy (Game Theory) Topic 1 – Part IV.
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.
How to Keep Score for Tennis How to Keep Score for Tennis
Investigation #1 Factors and Products.
The repeated games with lack of information on one side Now we focus on.
TIMES 3 Technological Integrations in Mathematical Environments and Studies Jacksonville State University 2010.
Copyright © 2009 Pearson Education, Inc. Chapter 12 Section 1 - Slide 1 Unit 7 Probability.
Population distribution VS Sampling distribution
Outline Random processes Random variables Probability histograms
Seminar 7 MM150 Bashkim Zendeli. Chapter 7 PROBABILITY.
Experimental Economics NSF short course David Laibson August 11, 2005.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
Playing the Lottery 6/4/2016Copyright © 2010… REMTECH, inc … All Rights Reserved1 Probability Theory and the Lottery ● The Lottery picks numbers at random.
MM1D2d: Use expected value to predict outcomes
Ping-pong, or table tennis is a sport or hobby that requires hand-eye coordination and skill. The key point in ping-pong is for a person to serve the.
Sullivan – Fundamentals of Statistics – 2 nd Edition – Chapter 6 Section 2 – Slide 1 of 31 Chapter 6 Section 2 The Binomial Probability Distribution.
Warm Up If Babe Ruth has a 57% chance of hitting a home run every time he is at bat, run a simulation to find out his chances of hitting a homerun at least.
Math I.  Probability is the chance that something will happen.  Probability is most often expressed as a fraction, a decimal, a percent, or can also.
Part 3 Linear Programming
KEYS Scott Gajewski ART 389A Spring Contents Premise Getting Started -Players -Set-up -Materials Rules -Basics -Points System -Multiple Players.
Welcome to MM570 Psychological Statistics
MAT 1000 Mathematics in Today's World. Last Time.
Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.
WOULD YOU PLAY THIS GAME? Roll a dice, and win $1000 dollars if you roll a 6.
GamblingGambling What are the odds? Jessica Judd.
Bell Work Please write the fraction, decimal AND percent. 1)Convert 4/5 to a decimal and a percent. 1)Convert.675 to a fraction and a Percent. 1)Convert.
President UniversityErwin SitompulPBST 4/1 Dr.-Ing. Erwin Sitompul President University Lecture 4 Probability and Statistics
Introduction to Counting. Why a lesson on counting? I’ve been doing that since I was a young child!
Copyright © 2010 Pearson Education, Inc. Chapter 16 Random Variables.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
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.
Chance We will base on the frequency theory to study chances (or probability).
Gambling and probability 1. Odds and football.  Predict the Premier League results for this weekend.  Can you estimate the probability of a win/draw/loss.
The Law of Averages. What does the law of average say? We know that, from the definition of probability, in the long run the frequency of some event will.
In games of chance the expectations can be thought of as the average outcome if the game was repeated multiple times. Expectation These calculated expectations.
Lecture 13.
BASIC PROBABILITY Probability – the chance of something (an event) happening # of successful outcomes # of possible outcomes All probability answers must.
Lecture 12.
Game Theory.
Presentation transcript:

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)  Y has red ace (A), black ace (A), black two (2)  On each turn, each player turns over one card  If both cards are the same color, X wins value of his card (1 for ace); if they are different, Y wins value of his card, except if both players play 2, neither player wins anything

AA2 A+1-2 A X Y Positive numbers: units won by X (colors match) Negative numbers: units won by Y (colors do not match)

From what was given in the model, I found 2 possible sets of rules for the game.  The game lasts an indefinite number of turns; on each turn, either player can play any of their cards. (Game 1)  The game lasts 3 turns; players can not play the same card twice. (Game 2) These two games have very different strategies!

What is the optimal strategy for this game? It depends! Depending on the strategy of your opponent (Y), the optimal strategy can differ dramatically! For example, if Y was very greedy, and thus played his or her black 2 often, your optimal strategy would involve playing your black ace more often than it otherwise might. On a basic level, Y will either play essentially randomly or at least attempt to play intelligently, and this makes a big difference. AA2 A+1-2 A X Y

If Y plays truly randomly (i.e. he plays each of his cards 1 /3 of the time), it is possible to calculate, on average, how much X will gain or lose for each card he plays-this can be done by multiplying the gain or loss of each possible outcome by how often it will appear (which in this case is always 1/3) Red A: 1( 1 / 3 )-1( 1 / 3 )-2( 1 / 3 ) = - 2 / 3 dollars Black A: -1( 1 / 3 )+1( 1 / 3 )+1( 1 / 3 ) = + 1 / 3 dollars Red 2: 2( 1 / 3 )-1( 1 / 3 )+0( 1 / 3 ) = + 1 / 3 dollars Therefore, X can play his black ace and red 2 in any combination and gain, on average, 1/3 dollars per turn AA2 A+1-2 A X Y If Y does not play truly randomly (few humans do!), this may not work; for example, if X always plays the black ace, eventually Y will start playing his red ace. Therefore, if playing against a real person who seems to play semi-randomly, X should vary his choices between the two cards and try not to fall into a pattern Y will notice. However...

If Y is an intelligent player (and he knows that X is as well), he will likely deduce that there’s no reason for X to play his red ace. Why? The red 2 can always do better or the same; i.e., it dominates the red ace.  If Y plays a red ace, X’s red 2 will win 2 units instead of just 1.  If Y plays a black ace, X’s red ace and 2 both lose 1 unit.  If Y plays a black 2, X’s red ace loses two and his red 2 loses none! Now, Y’s red 2 is dominated by his red ace, because he knows X should never play the red ace. AA2 A+1-2 A X Y We now have a simpler grid, as each player only has 2 real possibilities (and they will never gain by switching to the other. However, it is impossible to determine an optimal strategy for X without knowing what Y’s is. At this point X should use psychology; maybe Y will more often play his/her black ace, to avoid losing 2. Any specific pattern will be exploited by an intelligent human opponent, so some randomness must come into play.

 Because each player only has 3 cards, this game only lasts 3 turns. Also, the strategies are obviously different because each move affects the next moves, and on the 2 nd and 3 rd moves of the game, there are less choices.  Again, what X should do depends very much on what Y’s strategy is. AA2 A+1-2 A X Y

 Assuming Y has an equal chance of playing any of his cards, we can again find the expected payout for any particular strategy of X. Let’s assume he starts by playing his red ace. AA2 A+1-2 A X Y If Y responds with his own red ace, X gains one unit. Now, on the second turn, X has a choice of two cards: black ace and red two. If X plays his black ace and Y again responds with another black ace, X gains 1; on the final turn they both must play their 2 and there is no gain for either. Therefore, X will gain a total of 2. If Y instead responds with a black 2, X still gains 1; on the final turn X will lose one, making for a net gain of 1 for X. The average gain, then, for X playing the red ace is 1.5. If X plays his red 2 and Y plays a black ace, Y gains one; on the 3 rd turn X will have the black ace and Y the black 2. X will gain a total of 1. Finally, if X plays his red 2 and Y plays the black 2, X will end up with a total of +2. Again, if Y is playing randomly, X will gain 1.5 units on average with this strategy. Eight more cases of this type have to be considered!

 After all of that analysis, the final result… AA2 A+1-2 A X Y No matter X’s strategy, if Y plays randomly, the game is, on average, a draw! AA2Total A A X’s first play Y’s first play Expected value after 3 moves

 Let’s look at that chart again… but this time, from the point of view of Y, assuming X is playing randomly. AA2 A A Total+10 X’s first play Y’s first play Unlike X, Y does have a difference in his choices; his black ace, if played first, will on average win him 1/3 dollar per game, and his red ace will lose him 1/3 dollar per game. (Remember that + indicates scores for X and – indicates scores for Y!)

 An intelligent Y might then be expected to play his black ace first more often; if this is true, X should counter with his own black ace to maximize the expected value. However, Y might figure out X’s strategy and begin leading with his red ace, which gives him a large advantage. Again, there is no mathematical formula for what X should do; only analyzing the opponent and his play style will allow X to make money in the long term. AA2 A A Total+10 X’s first play Y’s first play (Remember that + indicates scores for X and – indicates scores for Y!) Note: In all cases, for both X and Y, the selection of the second card is a “wash”- neither card is better then the other. Psychology might again come into play, but both players need to remember that the third card needs to be played as well!

 If the game is played an indefinite number of times, X should play only his black ace or red 2 and try to avoid playing them in a specific pattern  If cards cannot be played more then once, X should probably start with his black ace most of the time, but he should make sure Y does not catch on to this strategy  In either case, if a human opponent is being played against, no specific strategy is always the best; the opponent’s own strategy and psychology must be taken into account