1 / 21

Nash Equilibrium

Nash Equilibrium. Econ 171. Suggested Viewing. A Student’s Suggestion: Video game theory lecture Open Yale Economics Ben Pollack’s Game Theory Lectures http://oyc.yale.edu/economics/game-theory/. Monte Hall Problem. Let’s Draw a Game Tree. HW Problem 2.11. Perfect Recall?.

xenon
Télécharger la présentation

Nash Equilibrium

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Nash Equilibrium Econ 171

  2. Suggested Viewing A Student’s Suggestion: Video game theory lecture Open Yale Economics Ben Pollack’s Game Theory Lectures http://oyc.yale.edu/economics/game-theory/

  3. Monte Hall Problem Let’s Draw a Game Tree

  4. HW Problem 2.11 Perfect Recall?

  5. Clicker Question 1: Strategy A2 Stategy B2 Strategy C2 Strategy A1 Strategy B1 Strategy C1 Player 1 Is the outcome where Player 1 plays B1 and Player 2 plays C2 a Nash equilibrium? Yes No

  6. Clicker Question 2: Strategy A2 Stategy B2 Strategy C2 Strategy A1 Strategy B1 Strategy C1 Player 1 Is the outcome where Player 1 plays A1 and Player 2 plays B2 a Nash equilibrium? Yes No

  7. Clicker Question 3: Strategy A2 Stategy B2 Strategy C2 Strategy A1 Strategy B1 Strategy C1 Player 1 Does this game have more than one Nash equilibrium? Yes No

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

  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.

  10. Battle of Sexes Bob Movie A Movie B Movie A Alice Movie B BRB(A)=A BRB(B)=B BRA(A)=A BRA(B)=B

  11. Prisoners’ Dilemma Game Player 2 Cooperate Defect P LAyER 1 Cooperate Defect

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

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

  14. How many Nash equilibria? 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. The Romney game? Textbook example. 3 candidates. Winner takes all. Strategy positive effort +1 for self or negative effort -2 for smeared candidate. Starting point. Candidate 1 has initial score 2, candidates 2 and 3 have initial scores 0. Nash equilibria. All positive. Candidates 2 and 3 both smear 1. Other Nash equilibria?

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

  18. 3-Hunter Stag Hunt Hunter 3 does Hare Hunter 3 does Stag Hunter 2 Hunter 2 Stag Hare Stag Hare Stag Stag Hunter 1 Hunter 1 Hare Hare Find the Nash equilibria

  19. 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.)

  20. 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.

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

More Related