Lecture Slides Dixit and Skeath Chapter 4

Slides:



Advertisements
Similar presentations
Principles of Game Theory
Advertisements

Chapter 17: Making Complex Decisions April 1, 2004.
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
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?
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.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
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.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Game Theory. “If you don’t think the math matters, then you don’t know the right math.” Chris Ferguson 2002 World Series of Poker Champion.
Part 3: The Minimax Theorem
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
Game Theory And Competition Strategies
An Introduction to Game Theory Part I: Strategic Games
Games with Simultaneous Moves I :Discrete Strategies
Game Theory Part 5: Nash’s Theorem.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Check your (Mis)understanding? Number 3.5 page 79 Answer Key claims that: For player 1 a strictly dominates c For player 2, y strictly dominates w and.
Chapter 9: Economics of Strategy: Game theory
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
- The Lockhorns Cartoon
1 1 Lesson overview BA 592 Lesson I.10 Sequential and Simultaneous Move Theory Chapter 6 Combining Simultaneous and Sequential Moves Lesson I.10 Sequential.
Yale lectures 3 and 4 review Iterative deletion of dominated strategies. Ex: two players choose positions on political spectrum. Endpoints become repeatedly.
Advanced Microeconomics Instructors: Wojtek Dorabialski & Olga Kiuila Lectures: Mon. & Wed. 9:45 – 11:20 room 201 Office hours: Mon. & Wed. 9:15 – 9:45.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
THE PROBLEM OF MULTIPLE EQUILIBRIA NE is not enough by itself and must be supplemented by some other consideration that selects the one equilibrium with.
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.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Chapter 7 Simultaneous-Move Games with Mixed Strategies I: Zero-Sum Games Norton Media Library AVINASH DIXIT SUSAN SKEATH.
QR 38, 2/27/07 Minimax and other pure strategy equilibria I.Minimax strategies II.Cell-by-cell inspection III.Three players IV.Multiple equilibria or no.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
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.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Today: Some classic games in game theory
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Games of Strategy THIRD EDITION
Game Theory Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.
Chapter 9: Static Games and Cournot Competition 1 Static Games and Cournot Competition.
\ B A \ Draw a graph to show the expected pay-off for A. What is the value of the game. How often should A choose strategy 1? If A adopts a mixed.
QR 38, 3/1/07 and 3/8/07 Mixed strategies I.Keeping the opponent indifferent II.Finding a mixed strategy equilibrium III.Odds ratios IV.Mixing in practice.
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.
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
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,
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.
Lecture III: Normal Form Games Recommended Reading: Dixit & Skeath: Chapters 4, 5, 7, 8 Gibbons: Chapter 1 Osborne: Chapters 2-4.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Chapter 28 Game Theory.
Microeconomics Course E
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
An introduction to game theory
Simultaneous-Move Games: Mixed Strategies
Simultaneous Move Games: Discrete Strategies
Communication Complexity as a Lower Bound for Learning in Games
THE ECONOMY: THE CORE PROJECT
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
UNIT II: The Basic Theory
Lecture Game Theory.
Presentation transcript:

Lecture Slides Dixit and Skeath Chapter 4

Simultaneous-Move Games with Discrete Strategies Pure Strategies vs. Mixed Strategies Game Matrix or Payoff Matrix Zero Sum Games - Interests of two players are exactly opposite each other. We can simplify the matrix by denoting only one value since other value is same with negative sign.

Fig. 4.1

Fig. 4.2

Nash Equilibrium A list of strategies, one for each player, such that no player can get a better payoff by switching to some other strategy while other players adhere to the strategies specified for them in the list. Since game is simultaneous, don’t know actual choices, but can instead consider “beliefs” about how others will behave.

Fig. 4.3

Finding Nash Equilibria Cell-By-Cell Inspection Dominance: Both Players Have Dominant Strategy or Just One Player Has Dominant Strategy Successive Elimination of Dominated Strategies Best-Response Analysis Minimax Method for Zero-Sum Games

Fig. 4.4 Both Have Dominant Strategies

Fig. 4.5 Congress Has Dominant Strategy, Fed Does Not

Fig. 4.6 Need to Be Careful When Eliminating Weakly Dominated Strategies

Fig. 4.7

Fig. 4.8

Fig. 4.9

Fig. 4.10

Multiple Equilibria Pure Coordination: Doesn’t matter which action they choose, only that they coordinate. Focal Points. Assurance: One outcome preferred. Still need to have enough certainty that the other is choosing the correct action. Need to have convergence of expectations about what the other person will choose.

Fig. 4.11

Fig. 4.12

Fig. 4.13 Asymmetric Payoffs

Resolving Conflicting Preferences Acting “Tough” or “Nice” may not lead to choosing same café. Coordination could achieved by negotiation. For example, in a repeated game, could have agreement to alternate locations.

Fig. 4.14

No Equilibrium in Pure Strategies Games often have this outcome. In this case, we can definitely say something about what you should not do. But can not say what you should do. Reasonable approach is to act unsystematically by choosing each strategy part of the time. But don’t choose in same pattern. Need to mix it up: Equilibrium in Mixed Strategies.

Fig. 4.15