1. Choose one of the numbers below. You will get 1 point if your number is the closest number to 3/4 of the average of the numbers chosen by all class members, otherwise you will get 0 points… A) 6 B) 5 C) 4 D) 3 E) 2 Clicker Game:

2. Iterated Deletion of Dominated Strategies Would a smart player choose 6? If you believe that everybody in the class is smart, would you ever choose 5? If you believe that everybody in the class is smart and believes everybody else is smart, what would you conclude? What if you take this another step?

3. Nash Equilibrium The real John NashHollywood’s Version

4. 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? A) Yes B) No

5. Nash Equilibrium in Chicken Game? 0, 0 0, 1 1, 0 -10, -10 Swerve Hang Tough Swerve Hang Tough Player 2 Pllayer 1 How many Nash equilibria does this game have? A)None B)Exactly one C)More than one

6. Definition A strategy profile is a Nash Equilibrium if each player’s strategy maximizes his payoff given the strategies used by the other players.

7. Clicker Question 6,03,24,1 2,3 2,8 1,12,05,2 Player 1 Strategy A1 Strategy B1 Strategy C1 Strategy A2 Stategy B2 Strategy C2 Is the outcome where Player 1 plays B1 and Player 2 plays C2 a Nash equilibrium? A)Yes B)No

8. Clicker Question 6,03,24,1 2,3 2,8 1,12,05,2 Player 1 Strategy A1 Strategy B1 Strategy C1 Strategy A2 Stategy B2 Strategy C2 Is the outcome where Player 1 plays A1 and Player 2 plays B2 a Nash equilibrium? A)Yes B)No

9. Best response mapping Best response for a player is a mapping from actions by the others to the action (or actions) that maximizes the player’s payoffs given the actions of the others. In Nash equilibrium, every player is doing the best response to what the other players are doing.

10. Prisoners’ Dilemma Game 10, 10 0, 11 11, 0 1, 1 CooperateDefect Cooperate Defect PLAyER 1 PLAyER 1 Player 2

11. Battle of Sexes 2,1 0,0 1,2 Bob Alice Movie A Movie B Movie A Movie B BR A (A)=A BR A (B)=B BR B (A)=A BR B (B)=B

12. Best Responses and Nash Equilibria for this game? BR 2 (a)=z BR 1 (w)=b BR 2 (b)={w,x,z} BR 1 (x)=b BR 2 (c)=y BR 1 (y)=b BR 2 (d)={y,z} BR 1 (z)={a,d}

13. Find Nash equilibria for these games Chicken Pure coordination (Driving Game)

14. How many Nash equilibria (in pure strategies)? There might be just one. There might be more than one. There might not be any.

15. Rock, Paper Scissors, Where is Nash equilibrium?

16. When is Nash equilibrium “the right answer”? 1.Players are “rational”. Each player’s strategy maximizes his payoff, given his beliefs about the strategies used by the other players. 2.Each player’s beliefs about the other players’ strategies are correct. When is 2) a reasonable assumption?

17. 3-Hunter Stag Hunt 2,2,20,1,0 1,0,01,1,0 Hunter 3 does Stag Hunter 3 does Hare Hunter 2 StagHare Stag Hare Hunter 1 0,0,10,1,1 1,0,11,1,1 Hunter 2 Stag Hare Stag Hare Find the Nash equilibria Hunter 1

18. Weakly dominated strategies? Nobody will use a strictly dominated strategy in Nash equilibrium. If there is a strictly dominant strategy for all players, it is a Nash equilibrium. (example Prisoners’ Dilemma.) Nash equilibrium does not exclude possibility of using a weakly dominated strategy. (A voting example with unanimous preferences.)

19. Nash and domination Every Nash equilibrium survives the iterated elimination of strictly dominated strategies. Not every outcome that satisfies the iterated elimination of strictly dominated strategies is a Nash equilibrium.

20. Clicker Question 6,03,24,1 2,3 2,8 1,12,05,2 Player 1 Strategy A1 Strategy B1 Strategy C1 Strategy A2 Stategy B2 Strategy C2 Does this game have more than one Nash equilibrium? A)Yes B)No

21. Game of previous slide reduced by IDSDS Strategy B2Strategy C2 Strategy A13,24,1 Strategy C12,05,2 Find the Nash equiibria for reduced game. These must be Nash equilibria for the original game. Note that strategy profiles C1,B2 and A1,C2 are not Eliminated by IDSDS, but are not Nash equillibria.

22. Clicker Question: What are the Nash Equilibria for this game? A) Player 1 plays a and Player 2 plays z. B)Player 1 plays d and Player 2 plays z. C)Player 1 plays b and Player 2 plays y. D)Both outcomes A) and B) are Nash equilibria. E)There are no Nash equilibria 4,1

23. A coordination game You choose one of three parties to go to Party X, Party Y, Party Z You like big parties and your payoff will be the number of people who attend the same party that you do. We will play this repeatedly with clickers. After each round, you will see how many people chose each option. Then you play again.

24. Which Party do you choose? A) Party Y B) Party X C) Party Z

25. Remember to Your On

26. Fictional play version You do the best response given the average of previous responses. Will this converge? If it converges, it converges to Nash equilibrium. Why?