Simultaneous- Move Games with Mixed Strategies Zero-sum Games.

Slides:



Advertisements
Similar presentations
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Advertisements

APPENDIX An Alternative View of the Payoff Matrix n Assume total maximum profits of all oligopolists is constant at 200 units. n Alternative policies.
Mixed Strategies For Managers
A Beautiful Game John C. Sparks AFRL/WS (937) Wright-Patterson Educational Outreach The Air Force Research Laboratory.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Game Theory “I Used to Think I Was Indecisive - But Now I’m Not So Sure” - Anonymous Mike Shor Lecture 5.
Two-Player Zero-Sum Games
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
Calibrated Learning and Correlated Equilibrium By: Dean Foster and Rakesh Vohra Presented by: Jason Sorensen.
1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)
Part 3: The Minimax Theorem
Working Some Problems. Telephone Game How about xexed strategies? Let Winnie call with probability p and wait with probability 1-p. For what values of.
Extensive Games with Imperfect Information
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Part 4: Dominant Strategies
Todd and Steven Divide the Estate Problem Bargaining over 100 pounds of gold Round 1: Todd makes offer of Division. Steven accepts or rejects. Round.
Yale 9&10 Mixed Strategies in Theory and Tennis. Overview As I randomize the strategies, the expected payoff is a weighted average of the pure strategies.
Games of pure conflict two person constant sum. Two-person constant sum game Sometimes called zero-sum game. The sum of the players’ payoffs is the same,
Game theory The study of multiperson decisions Four types of games
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/12.
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Lecture Slides Dixit and Skeath Chapter 4
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Lectures in Microeconomics-Charles W. Upton Minimax Strategies.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Simulating Normal Random Variables Simulation can provide a great deal of information about the behavior of a random variable.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna S-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Supplement 1.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/23 3/9.
Game Theory.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
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.
Minimax strategies, Nash equilibria, correlated equilibria Vincent Conitzer
Chapter 9 Games with Imperfect Information Bayesian Games.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Game Theory Warin Chotekorakul MD 1/2004. Introduction A game is a contest involving to or more players, each of whom wants to win. Game theory is the.
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.
Bayes-Nash equilibrium with Incomplete Information.
Games with Imperfect Information Bayesian Games. Complete versus Incomplete Information So far we have assumed that players hold the correct belief about.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.
Extensive Games with Imperfect Information
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.
Normal Form Games, Normal Form Games, Rationality and Iterated Rationality and Iterated Deletion of Dominated Strategies Deletion of Dominated Strategies.
1. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.
Zero-sum Games The Essentials of a Game Extensive Game Matrix Game Dominant Strategies Prudent Strategies Solving the Zero-sum Game The Minimax Theorem.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
5.1.Static Games of Incomplete Information
1 The Volunteer’s Dilemma (Mixed Strategies). 2 The Volunteer Dilemma Game Simultaneously and independently, players have to decide if they wish to volunteer.
Games of pure conflict two-person constant sum games.
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
GAME THEORY Day 5. Minimax and Maximin Step 1. Write down the minimum entry in each row. Which one is the largest? Maximin Step 2. Write down the maximum.
9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.
Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F
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.
Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F
Mixed Strategies Keep ‘em guessing.
Simultaneous-Move Games: Mixed Strategies
Chapter 6 Game Theory (Module 4) 1.
Game Theory.
LECTURE 2 MIXED STRATEGY GAME
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Lecture Game Theory.
Presentation transcript:

Simultaneous- Move Games with Mixed Strategies Zero-sum Games

Mixed Strategy Random choice of the pure strategies Pure strategy of probability distribution Suppose Player one has 2 strategies, A and B. Let p in [0,1] be the probability for Player one to play A, then 1-p is the probability to play B. When p=1, one plays A purely and when p=0, one plays B purely.

Expected payoff Suppose E plays DL with p=0.75, when N plays DL, E ’ s expected payoff is 0.75x x90=60. Suppose N also plays mixed strategies with prob. q=0.2 for playing DL. Then E ’ s expected payoff is 0.2x50+0.8x80=74 for playing DL 0.2x90+0.8x20=34 for CC. 0.75x x34=63.66 for mixed with p=0.75 Navratilova DLCC Evert DL50, 5080, 20 CC90, 1020, 80

For any p, E ’ s expected payoff is 50p+90(1-p)=90-40p when N plays DL 80p+20(1-p)=20+60p when N plays CC Note 90-40p>20+60p when p<0.7

Minimax Method p E ’ s payoff N ’ s DL N ’ s CC

If N mixes her strategies, E ’ s payoff is between two lines. For p<=0.7, N playing CC purely will minimize E ’ s payoff (Note E can guarantee a payoff equal to 20+60p) For p>=0.7, N playing DL purely will minimize E ’ s payoff (Note E can guarantee a payoff equal to 90-40p) E can choose p=0.7 to maximin to get 62 no matter N picks DL or CC

q N ’ s payoff E ’ s CC, N ’ s payoff=80-70q E ’ s DL, N ’ s payoff=20+30q

Maximin strategy (p, q)=(0.7,0.6) With N playing q=0.6, E ’ s expected payoff is 50x.6+80x.4=62 for playing DL purely 90x.6+20x.4=62 for playing CC purely With E playing p=0.7, N ’ s expected payoff is 50x.7+10x.3=38 for playing DL purely 20x.7+80x.3=38 for playing CC purely

N.E. in mixed strategy Theorem If a player would mix two or more strategies as the N.E strategy, the expected payoffs from playing those strategies purely (given opponents ’ equilibrium strategies) should be the same, as the equilibrium payoff under the mixed strategy.

DLCCq-mix DL50, 5080, 20 50q+80(1-q), 50q+20(1-q) CC90, 1020, 80 90q+20(1-q), 10q+80(1-q) p-mix 50p+90(1-p), 50p+10(1-p) 80p+20(1-p), 20p+80(1-p)

For Evert 50q+80(1-q)>90q+20(1-q) if q<0.6 Pure DL (p=1) when q<0.6 50q+80(1-q) 0.6 Pure CC (p=0) when q>0.6 50q+80(1-q)=90q+20(1-q) if q=0.6 Any mix (p=0~1) when q=0.6

For Navratilova 50p+10(1-p)>20p+80(1-p) if p>0.7 Pure DL (q=1) when p>0.7 50p+10(1-p)<20p+80(1-p) if p<0.7 Pure CC (q=0) when p<0.7 50p+10(1-p)=20p+80(1-p) if p=0.7 Any mix (q=0~1) when p=0.7

p q E ’ s best response N ’ s best response N.E. (0.7, 0.6) 0.7

Follow the theorem, E would mix if 50q+80(1-q)=90q+20(1-q) or q=0.6, so that she ’ s indifferent between DL and CC (both 62). And N would mix if p=0.7. Opponent ’ s indifference property. N.E. as a system of beliefs. Consider mixed strategy, then N.E. will be the same as minimax method.

When one has 3 strategies DLCCq-mix DL q+80(1 -q) CC q+20(1 -q) Lob q+60(1 -q) p-mix 50p1+90p 2+70(1- p1-p2) 80p1+20p 2+60(1- p1-p2)

E will mix the three if there ’ s a q such that 50q+80(1-q)= 90q+20(1- q)= 70q+60(1-q). However the answer is NO. It means E will only mix the two out of the three.

Case1: E mixes DL & CC only. From previous argument p=0.7 and q=0.6, and payoffs are 62 for E, 38 for N. When playing Lob purely with q=0.6, expected payoff=66, thus E will deviate. (0.7, 0.3, 0) cannot be E ’ s equilibrium strategy.

Case2: E mixes DL & Lob only. E will mix the two when 50q+80(1- q)=70q+60(1-q) or q=0.5. For N to mix, when 50p+30(1- p)=20p+40(1-p), or p=0.25. Payoffs are 65 and 35 respectively When playing CC purely with q=0.5, expected payoff=55, thus E will NOT deviate. [(0.25, 0, 0.75), (0.5, 0.5)] is a N.E.

Case3: E mixes CC & Lob only. E will mix the two when 90q+20(1- q)=70q+60(1-q) or q=2/3. For N to mix, when 10p+30(1- p)=80p+40(1-p), never. Actually N will play CC purely since CC dominates DL when E mixes only CC & Lob. In equilibrium, E will not just mix CC & Lob.

Homework 1, Question 3 of Exercise 2. Find the N.E in the following strategic form game LMR U1, 33, 41, 0 D0, 52, 23, 6