Oligopoly & Game Theory Lecture 27

Slides:



Advertisements
Similar presentations
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Advertisements

Prisoner’s Dilemma An illustration of Nash Equilibrium Art’s Strategies Bob’s Strategies Confess Deny Confess Deny 10 yrs. 1 yr. 3 yrs. 1 yr. 10 yrs.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Chapter 10 Game Theory and Strategic Behavior
1 Game Theory. By the end of this section, you should be able to…. ► In a simultaneous game played only once, find and define:  the Nash equilibrium.
AP Economics Mr. Bernstein Module 65: Game Theory December 10, 2014.
Game Theory. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.
1 Oligopoly 2 Oligopoly - Competition among the Few u In an oligopoly there are very few sellers of the good. u The product may be differentiated among.
An Introduction to Game Theory Part I: Strategic Games
The Prisoner’s Dilemma -Both arrested during botched bank robbery. -Kept in separate cells – NO COMMUNICATION. -Offered separate deals if they confess.
Strategic Decisions Making in Oligopoly Markets
Chapter 9: Economics of Strategy: Game theory
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Lectures in Microeconomics-Charles W. Upton Game Theory.
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.
1 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.
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.
1 Section 2d Game theory Game theory is a way of thinking about situations where there is interaction between individuals or institutions. The parties.
Game Theory The Prisoner’s Dilemma Game. “Strategic thinking is the art of outdoing an adversary, knowing that the adversary is trying to do the same.
Strategic Decisions in Noncooperative Games Introduction to Game Theory.
Chapter 12 - Imperfect Competition: A Game-Theoretic Approach Copyright © 2015 The McGraw-Hill Companies, Inc. All rights reserved.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson Micro: Econ: Module.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
Chapter 16 Oligopoly and Game Theory. “Game theory is the study of how people behave in strategic situations. By ‘strategic’ we mean a situation in which.
Lec 23 Chapter 28 Game Theory.
Oligopoly CHAPTER 13B. Oligopoly IRL In some markets there are only two firms. Computer chips are an example. The chips that drive most PCs are made by.
KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson 65 Module.
The Prisoner’s Dilemma or Life With My Brother and Sister John CT.
Advanced Subjects in GT Outline of the tutorials Static Games of Complete Information Introduction to games Normal-form (strategic-form) representation.
Oligopoly & Game Theory Lecture 26 Dr. Jennifer P. Wissink ©2016 John M. Abowd and Jennifer P. Wissink, all rights reserved. May 4, 2016.
John Forbes Nash John Forbes Nash, Jr. (born June 13, 1928) is an American mathematician whose works in game theory, differential geometry, and partial.
What Is Oligopoly? Oligopoly is a market structure in which
Game theory Chapter 28 and 29
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.
Microeconomics Course E
Intermediate Microeconomics
ECON 330 Lecture 11 Tuesday, October 30.
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Monopolistic Competition Lecture 25
©2011 John M. Abowd and Jennifer P. Wissink, all rights reserved.
Oligopoly & Game Theory Lecture 26
Module 32 Game Theory.
Chapter 12 - Imperfect Competition: A Game-Theoretic Approach
Simultaneous Move Games: Discrete Strategies
11b Game Theory Must Know / Outcomes:
Introduction to Game Theory
Game theory Chapter 28 and 29
©2011 John M. Abowd and Jennifer P. Wissink, all rights reserved.
Managerial Economics Kyle Anderson
Imperfect Competition
Game Theory Module KRUGMAN'S MICROECONOMICS for AP* Micro: Econ:
Oligopoly & Game Theory Lecture 27
GAME THEORY AND APPLICATIONS
THE ECONOMY: THE CORE PROJECT
Strategic Decision Making in Oligopoly Markets
Game Theory II – Repeated Games
17. Game theory G 17 / 1 GENERAL ECONOMICS 6
Choices Involving Strategy
Monopolistic Competition Lecture 25
11b – Game Theory This web quiz may appear as two pages on tablets and laptops. I recommend that you view it as one page by clicking on the open book icon.
Managerial Economics Kyle Anderson
GAME THEORY AND APPLICATIONS
Economic Foundations of Strategy
Game Theory and Strategic Play
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture Game Theory.
Game Theory: The Nash Equilibrium
Lecture 8 Nash Equilibrium
Presentation transcript:

Oligopoly & Game Theory Lecture 27 Dr. Jennifer P. Wissink ©2018 John M. Abowd and Jennifer P. Wissink, all rights reserved. May 7, 2018

Game Theory: Setup List of players: all the players are specified in advance. List of actions: all the actions each player can take are spelled out. Rules of play: who moves and when is spelled out. Information structure: who knows what and when is spelled out. Strategies: the set of actions players can use. Payoffs: the amount each player gets for every possible combination of the players’ strategies. Solution or equilibrium concept: a way you reason that players select strategies to play, and then consequently how you predict the outcome of the game.

Dominant Strategy Equilibrium A Dominant Strategy for player “i” is a strategy such that player’s i’s payoff from playing that strategy is at least as large as the payoff player i would get from playing any other strategy, no matter what player i’s rivals choose as their strategies. A Dominant Strategy Equilibrium of a game occurs when each player of the game has and plays his/her dominant strategy. Lots of interesting games have dominant strategy equilibriums. And for lots of interesting and fun games DON’T.

The Prisoners’ Dilemma Game & Dominant Strategy Equilibrium Roger and Chris have been accused of a major crime (which they committed). They also have outstanding warrants based on minor crimes, too. They are held in isolated cells and offered the choice to either Lie or Confess. The payoff matrix shows the number of years of prison Roger (the row player) and Chris (the column player) will receive depending upon who confesses and who lies as (Roger’s prison time, Chris’ prison time). The game is played one-shot, simultaneously and non-cooperatively with full information.

The Prisoners’ Dilemma Is Very Distressing..., Or Is It? In the Prisoners’ Dilemma game, the “superior” outcome is when both prisoners lie – but that requires cooperation. When the game is only played once, simultaneously and non-cooperatively, (confess, confess) is the dominant strategy equilibrium and (-5, -5) is the dominant strategy equilibrium outcome. Could Roger & Chris sustain the (lie, lie) outcome of (-1, -1) somehow? change the payoffs in the matrix play the game repeatedly Do all games have at least one dominant strategy equilibrium? NO! Then what?

Nash Equilibrium Named after John Nash - a Nobel Prize winner in Economics. Did you read or see A Beautiful Mind? A Nash Non-cooperative Strategy (Best Response) for player “i” is a strategy such that player’s i’s payoff from playing that strategy is at least as large as the payoff player i would get from playing any other strategy, given the strategies the others are playing. A Nash Non-cooperative Equilibrium is a set of (Nash) strategies for all players, such that, when played simultaneously, they have the property that no player can improve his payoff by playing a different strategy, given the strategies the others are playing.

Hotelling's Location Game (Nash Equilibrium in Location)

The Price Game Chris Low High Low 20, 20 60, 0 Roger High 0, 60 100, 100 i>clicker question: Are there any dominant strategy equilibria? Yes No. i>clicker question: Are there any Nash equilibria? Yes No. i>clicker question: Which Nash equilibrium do you think is more likely? Low, Low High, High.

Maximin Equilibrium Chris Low High Low 20, 20 60, 0 Roger High 0, 60 More proactive than reactive. Pessimistic? The “min” part of maximin: for each of his options the player determines his worst outcome(s). The “max” part of maximin: the player then looks over all his worst case scenarios for each strategy and picks the best of the worst. The equilibrium part of maximin: When each player has a maximin strategy and when played against each other they are a Nash equilibrium. So all maximin equilibria are Nash equilibria. Not all Nash equilibria are maximin equilibria. Chris Low High Low 20, 20 60, 0 Roger High 0, 60 100, 100

Consider the following game between Roger and Chris Consider the following game between Roger and Chris. It is played one shot, simultaneously and non-cooperatively. CHRIS Left Right ROGER Top 10, 2 22, 2 Middle 20, 20 10, 20 Bottom 10, 5 5, 20 i>clicker question: Are there any dominant strategy equilibria? Yes No i>clicker question: Are there any Nash equilibria? Yes No i>clicker question: Are there any maximin equilibria? Yes No

Another Game To Try Player 1 is the row player and can select numbers. 10, 20 30, 15 10, 15 16, 12 2 20, 10 30, 40 20, 25 8, 24 3 20, 20 12, 20 15, 10 25, 29 4 10, 10 15, 24 11, 27 Player 1 is the row player and can select numbers. Player 2 is the column player and can select letters. The payoffs are (Player 1, Player 2) Game is one-shot, simultaneous, non-cooperative, full information. Are there any… Dominant strategy equilibriums? Nash? Maximin?