Working Some Problems.

Slides:



Advertisements
Similar presentations
Mixed Strategies.
Advertisements

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 Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
Mixed Strategies For Managers
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Simultaneous- Move Games with Mixed Strategies Zero-sum Games.
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
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.
For any player i, a strategy weakly dominates another strategy if (With at least one S -i that gives a strict inequality) strictly dominates if where.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Part 3: The Minimax Theorem
Batter Up! To play, click the presentation button.
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.
Wyatt Earp and the Gun Slinger
Cheap Talk. When can cheap talk be believed? We have discussed costly signaling models like educational signaling. In these models, a signal of one’s.
Games with Simultaneous Moves I :Discrete Strategies
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
EC102: Class 9 Christina Ammon.
Playing in the Dark Problems from Ch 8. The OS2 story Introduced by IBM in 1987 to compete with MS Windows. Faster and more reliable than Windows but.
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.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
January 20 Lecture Econ 171. The game of matching pennies has A)two pure strategy Nash equilibria B)One pure strategy Nash equilibrium C)One mixed strategy.
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,
Reviewing Bayes-Nash Equilibria Two Questions from the midterm.
Game Theory and Applications following H. Varian Chapters 28 & 29.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/12.
6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.
Game Theory Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents. Been used to study –Market.
Game Theoretic Analysis of Oligopoly lr L R 0000 L R 1 22 The Lane Selection Game Rational Play is indicated by the black arrows.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
Game Theory “I used to think I was indecisive – but now I’m not so sure.” - Anonymous Topic 4 Mixed Strategies.
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.
1 Economics & Evolution Number 3. 2 The replicator dynamics (in general)
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
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.
Example 31: Solve the following game by equal gains method: Y I II I II I X II II
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.
Cheap Talk. When can cheap talk be believed? We have discussed costly signaling models like educational signaling. In these models, a signal of one’s.
Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Creating Institutions to Address Externalities TMS.
Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F
Games of pure conflict two-person constant sum games.
Q 2.1 Nash Equilibrium Ben
Mixed Strategies Keep ‘em guessing.
Working Some Problems.
Nash Equilibrium: Theory
Somebody’s got to do it. Somebody’s got to do it.
Simultaneous-Move Games: Mixed Strategies
Replicator Dynamics.
A tool for modeling strategic interactions
Simultaneous Move Games: Discrete Strategies
CPS 570: Artificial Intelligence Game Theory
Games of pure conflict two person constant sum
Game Theory Fall Mike Shor Topic 3.
Chapter 6 Game Theory (Module 4) 1.
LECTURE 2 MIXED STRATEGY GAME
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Game Theory and Strategic Play
Lecture 20 Linear Program Duality
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Lecture Game Theory.
Instructor: Vincent Conitzer
Presentation transcript:

Working Some Problems

A Duel Does this game have any pure strategy equilibria? Yes No Pitcher throws Fastball Curveball .35,.65 .3,.7 .2,.8 .5,.5 Batter prepares for Does this game have any pure strategy equilibria? Yes No

Finding Mixed strategy equilibrium In N.E, Batter will play each strategy with positive probability only if the two strategies have the same expected payoff for him. Suppose Pitcher throws a fastball with probability p and a curveball with probability 1-p. Batter’s expected payoff from “Prepare for Fastball” is .35p+.30(1-p) Batter’s expected payoff from “Prepare for curveball” is .2p+.5(1-p). These payoffs are equal if .35p+.30(1-p)=.2p+.5(1-p). Solve this equation for p.

A Duel In a mixed strategy Nash equilibrium what is the Pitcher throws Fastball Curveball .35,.65 .3,.7 .2,.8 .5,.5 Batter prepares for In a mixed strategy Nash equilibrium what is the probability that Batter prepares for a fastball? 4/7 3/7 ½ 6/7 4/5

Does this game have a Nash equilibrium in which Kicker mixes left and right but does not kick to center?

If there is a Nash equilibrium where kicker never kicks middle but mixes between left and right, Goalie will never play middle but will mix left and right (Why?) If Goalie never plays middle but mixes left and right, Kicker will kick middle. (Why?) So there can’t be a Nash equilibrium where Kicker never kicks Middle. (See why?)

Problem 4: For what values of x is there a mixed strategy Nash equilibrium in which the victim might resist or not resist and the Mugger assigns zero probability to showing a gun?

Problem 7.7, Find mixed strategy Nash equilibria

A mixed strategy N.E. strategy does not give positive probability To any strictly dominated strategy c dominates a and y dominates z Look at reduced game without these strategies

Problem 7.7 Find mixed strategy Nash equilibia For player 1, Bottom strictly dominates Top. Throw out Top Then for Player 2, Middle weakly dominates Right. Therefore if Player 1 plays bottom with positive probability, player 2 gives zero Probability to Right. There is no N.E. in which Player 1 plays Bottom with zero probability, (Why?) (If he did, what would Player 2 play? Then what would 1 play?)

Problem 8, Chapter 7 A Nash equilibrium is any strategy pair in which the defense defends against the outside run with probability .5 and the offense runs up the middle with probability .75. No matter what the defense does, The offense gets the same payoff from wide left or wide right, So any probabilities pwl and pwr such that pwl+pwr=.25 will be N.E. probabilities for the offense.

Problem 10. Each of three players is deciding between the pure strategies go and stop. The payoff to go is 120, where m is the number of players that choose go, and the payoff to stop is 55 m (which is received regardless of what the other players do). Find all Nash equilibria in mixed strategies. Let’s find the “easy ones”. Are there any symmetric pure strategy equilibria? How about asymmetric pure strategy equilibria? How about symmetric mixed strategy equilibrium? Solve 40p^2+60*2p(1-p)+120(1-p)2=55 40p2-120p+65=0

What about equilibria where one guy is in for sure and other two enter with identical mixed strategies? For mixed strategy guys who both Enter with probability p, expected payoff from entering is (120/3)p+(120/2)(1-p). They are indifferent about entering or not if 40p+60(1-p)=55. This happens when p=1/4. This will be an equilibrium if when the other two guys enter with Probability ¼, the remaining guy is better off entering than not. Payoff to guy who enters for sure is: 40*(1/16)+60*(3/8)+120*(9/16)=92.5>55.

Advanced Rock-Paper-Scissors 0,0 -1,1 2,-2 1,-1 -2,2 Are there pure strategy Nash equilibria? Is there a symmetric mixed strategy Nash equilibrium? What is it?

Remember: Midterm on Thursday Chapters 2-5 and 7 No need to bring bluebooks. Calculators and phones not allowed