Bayes-Nash equilibrium with Incomplete Information

Slides:



Advertisements
Similar presentations
Problem 10.4: Sealed-bid, first Price Auction Independent private values Probability is ¾ that a bidder has value H and ¼ that bidder has value L, where.
Advertisements

Mixed Strategies.
Signaling Econ 171.
The Unpleasant Professor Problem
Infinitely Repeated 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.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Crime, Punishment, and Forgiveness
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Private Information and Auctions
Clicker Question-A Chicken Game 0, 0 0, 1 1, 0 -10, -10 Swerve Hang Tough Swerve Hang Tough Player 2 Pllayer 1 Does either player have a dominant strategy?
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
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.
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
1 Game Theory. 2 Agenda Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Infinitely Repeated Games Econ 171. Finitely Repeated Game Take any game play it, then play it again, for a specified number of times. The game that is.
Problems from Chapter 8. Galileo and the Papal Inquisition.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Taking Turns in the Dark (Subgame perfection with imperfect information) Econ 171.
Chapter 11 Game Theory and the Tools of Strategic Business Analysis.
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.
1 Business System Analysis & Decision Making - Lecture 5 Zhangxi Lin ISQS 5340 July 2006.
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.
More on Extensive Form Games. Histories and subhistories A terminal history is a listing of every play in a possible course of the game, all the way to.
Reviewing Bayes-Nash Equilibria Two Questions from the midterm.
ECON6036 1st semester Format of final exam Same as the mid term
APEC 8205: Applied Game Theory Fall 2007
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
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.
Exam Questions. Fred and Elmer No Price War Price War.
Chapter 9 Games with Imperfect Information Bayesian Games.
Punishment and Forgiveness in Repeated Games. A review of present values.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
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.
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.
Chapter 5 Game Theory and the Tools of Strategic Business Analysis.
Extensive Games with Imperfect Information
Topic 3 Games in Extensive Form 1. A. Perfect Information Games in Extensive Form. 1 RaiseFold Raise (0,0) (-1,1) Raise (1,-1) (-1,1)(2,-2) 2.
ECO290E: Game Theory Lecture 13 Dynamic Games of Incomplete Information.
Subgames and Credible Threats (with perfect information) Econ 171.
Subgames and Credible Threats
Subgames and Credible Threats. Nuclear threat USSR Don’t Invade Hungary 0101 Invade US Give in Bomb USSR
Incomplete information: Perfect Bayesian equilibrium
Dynamic games, Stackelburg Cournot and Bertrand
Subgames and Credible Threats. Russian Tanks Quell Hungarian Revolution of 1956.
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.
Extensive Form (Dynamic) Games With Perfect Information (Theory)
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.
Taking Turns in the Dark: (Subgame perfection with incomplete information ) Econ 171.
Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 1 A Quick Review of Game Theory and, in particular, Bayesian Games.
Incomplete Information and Bayes-Nash Equilibrium.
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.
ECO290E: Game Theory Lecture 10 Examples of Dynamic Games.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.1.Dynamic Games of Complete and Perfect Information Lecture
Dynamic Games of complete information: Backward Induction and Subgame perfection.
Final Lecture.
Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F
Somebody’s got to do it. Somebody’s got to do it.
Econ 805 Advanced Micro Theory 1
Signaling Econ 171.
Games with Imperfect Information Bayesian Games
Presentation transcript:

Bayes-Nash equilibrium with Incomplete Information Econ 171

First some problems The Goblins. Working backwards. What if there are 100 Goblins

Todd and Steven Problem

Problem 1 p 281

How many proper subgames are there? 1 2 4 6

The Yule Ball

How many strategies are possible for Hermoine? 2 4 6 D) 8

What are the strategies? Victor and Ron each have only one information set and only two possible actions, ask or don’t ask. Hermione has 3 information sets at which she must choose a move. A strategy specifies whether she will say yes or no in each of them. Set 1: Victor has asked: Say yes or no to Ron Set 2: Victor has asked, Hermione said no, Ron asked: Say yes or no to Ron Set 3: Victor didn’t ask and Ron asked: Say yes or No to Ron So she has 8 possible strategies.

Dating Dilemma Victor Asks Hermione Y,Y,Y Y,Y,N Y,N,Y Y,N,N N,Y,Y 8,3,6 1,8*,8* 3,2,4 Don’t 7*,6*,5* 2,5,3 2,5*,3 Ron Victor Doesn’t Ask Hermione Y,Y,Y Y,Y,N Y,N,Y Y,N,N N,Y,Y N,Y,N N,N,Y N,N,N Ask 4,7*,7* 6,1,2 *4,7*,7* Don’t 5,4,1 Ron

Simplifying the Game If Hermione ever reaches either of the two nodes where Ron gets to ask her, she would say Yes. So a subgame perfect equilibrium must be a Nash equilbrium for the simpler game in which Hermione always says “yes” to Ron if she hasn’t accepted a date from Victor.

Victor Asks Hermione’s strategy Yes to Victor No to Victor Ask 8,3,6 1,8*,8* Don’t Ask 7*,6*,5* 2,5,3 Ron’s Strategy Victor Doesn’t Ask Hermione’s strategy Yes to Victor No to Victor Ask 4,7*,7* 4*,7*,7* Don’t Ask 5,4,1* Ron’s Strategy

What are the strategies used in subgame perfect equilibria? Equilibrium 1) Victor asks Ron doesn’t ask Hermoine says yes to V if V asks, Yes to Ron if she says No to V and Ron asks, Yes to Ron if Ron asks and Victor doesn’t ask. Equilibrium 2) Victor doesn’t ask Ron Asks Hermoine would say No to V if Victor asked, Yes to Ron and Victor asked and she said no to V, Yes to Ron if Ron asked and Victor didn’t.

She loves me, she loves me not? Nature She loves him She scorns him Bob Bob Go to A Go to B Go to A Go to B Alice Alice Alice Alice Go to B Go to B Go to A Go to A Go to B Go to A Go to A Go to B 1 3 2 2 3 3 2 1 2 1 3

Whats New here? Incomplete information: Bob doesn’t know Alice’s payoffs In previous examples we had “Imperfect Information”. Players Knew each others payoffs, but didn’t know the other’s move.

Bayes-Nash Equilibrium Alice could be one of two types. “loves Bob” “scorns Bob Whichever type she is, she will choose a best response. Bob thinks the probability that she is a loves Bob type is p. He maximized his expected payoff, assuming that Alice will do a best response to his action.

Expected payoffs to Bob If he goes to movie A, he knows that Alice will go to A if she loves him, B if she scorns him. His expected payoff from A is 2p+0(1-p)=2p. If he goes to movie B, he knows that Alice will go to B if she loves him, A if she scorns him. His expected from B is then 3p+1(1-p)=2p+1. For any p, his best choice is movie B.

Does she or doesn’t she? Simultaneous Play Nature She loves him She scorns him Bob Bob Go to A Go to B Go to A Go to B Alice Alice Alice Alice Go to B Go to B Go to A Go to A Go to B Go to A Go to A Go to B 1 3 2 2 3 3 2 1 2 1 3

Bayes’ Nash equilibrium Is there a Bayes’ Nash equilibrium where Bob goes to B and Alice goes where Alice goes to B if she loves him, and to A if she scorns him? This is a best response for both Alice types. What about Bob?

Bob’s Calculations If Bob thinks the probability that Alice loves him is p and Alice will go to B if she loves him and A if she scorns him: His expected payoff from going to B is 3p+1(1-p)=1+2p. His expected payoff from going to A is 2(1-p)+0p=2-2p. Going to B is Bob’s best response to the strategies of the Alice types if 1+2p>=2-2p. Equivalently p>=1/4.

Is there a Bayes-Nash equilibrium in pure strategies if p<1/4? Yes, Alice goes to B if she loves Bob and A if she scorns him and Bob goes to B. Yes, Alice goes to A if she loves Bob and B if she scorns him and Bob goes to B. Yes there is one, where Alice always goes to A. No there is no Bayes-Nash equilibrium in pure strategies.

What about a mixed strategy equilibrium? Can we find a mixed strategy for Bob that makes one or both types of Alice willing to do a mixed strategy? Consider the Alice type who scorns Bob. If Bob goes to movie A with probability q, When will Alice be indifferent between going to the two movies?