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.

Slides:



Advertisements
Similar presentations
Game Theory. I What is Game theory? The Theory of Games and Economic Behaviour by John von Neumann and Oskar Morgenstern (1944). Especially one institution:
Advertisements

The Basics of Game Theory
GAME THEORY.
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.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Game Theory S-1.
APPENDIX An Alternative View of the Payoff Matrix n Assume total maximum profits of all oligopolists is constant at 200 units. n Alternative policies.
Game Theory “I Used to Think I Was Indecisive - But Now I’m Not So Sure” - Anonymous Mike Shor Lecture 5.
Two-Player Zero-Sum Games
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.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
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.
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.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.
EKONOMSKA ANALIZA PRAVA. Game Theory Outline of the lecture: I. What is game theory? II. Elements of a game III. Normal (matrix) and Extensive (tree)
Chapter 15- Game Theory: The Mathematics of Competition
1 1 Lesson overview BA 592 Lesson I.6 Simultaneous Move Problems Chapter 4 Simultaneous Move Games with Pure Strategies … Lesson I.5 Simultaneous Move.
Short introduction to game theory 1. 2  Decision Theory = Probability theory + Utility Theory (deals with chance) (deals with outcomes)  Fundamental.
Part 3: The Minimax Theorem
QR 38 3/22/07, Strategic moves and structure-induced equilibria I. Strategic moves II. Credibility III. Strategic moves as institutional choice.
An Introduction to Game Theory Part I: Strategic Games
Game Theory Part 5: Nash’s Theorem.
2008/02/06Lecture 21 ECO290E: Game Theory Lecture 2 Static Games and Nash Equilibrium.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
5/16/20151 Game Theory Game theory was developed by John Von Neumann and Oscar Morgenstern in Economists! One of the fundamental principles of.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Static Games of Complete Information: Equilibrium Concepts
QR 38, 2/6/07 Overview of game theory I. Strategic interaction II. Game theory and international relations III. Deterrence.
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.
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
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.
QR 38 3/20/07, More on repeated games in IR I.Folk theorem II.Other solutions to the PD III.Repeated PDs in practice.
Lecture Slides Dixit and Skeath Chapter 4
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
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.
Game Theory.
Game Theory.
Chapter 12 & Module E Decision Theory & Game Theory.
Game Theory Formalizing the Hobbesian Dilemma. A. Assumptions 1. Assumptions a. Rational choice – People act according to their preferences (desires,
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
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.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
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.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
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.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
GAME THEORY Day 5. Minimax and Maximin Step 1. Write down the minimum entry in each row. Which one is the largest? Maximin Step 2. Write down the maximum.
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.
Q 2.1 Nash Equilibrium Ben
Intermediate Microeconomics
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Game Theory.
Alpha-Beta Search.
Alpha-Beta Search.
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Alpha-Beta Search.
Alpha-Beta Search.
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
UNIT II: The Basic Theory
Alpha-Beta Search.
Presentation transcript:

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 equilibria V.Cooperation, coordination, and competition in IR

I. Minimax strategies The minimax method of finding a Nash equilibrium applies only to zero-sum games. It relies on recognizing that whatever is good for one player is bad for the other. So, A will anticipate that B will choose the strategy that is worst for A.

Minimax strategies Knowing this, A should choose a strategy that provides the best of these bad outcomes. That is, A what to maximize the minimum payoff.

Boundary dispute game Defense is the column player Offense is the row player Choosing a military strategy The number in each cell is row’s payoff; only need to show this because the game is zero-sum. Row wants to maximize, column to minimize

Boundary dispute game So, for each player identify the worst payoff: this is the minimum number in each row, and the maximum number in each column.

Boundary dispute game GroundAirNuclear Ground attack 2513 Ground and air Air64.51 Nuclear103-2

Minimax method Offense knows that for each row, defense will choose the column with the lowest number in that row. So, offense should choose the row that gives the maximum among the minima; the maximin.

Minimax method Defense knows that for each column, offense will choose the row with the largest number. So defense should choose the column with the smallest number among the maxima; the minimax. If the maximin and the minimax values occur in the same cell, the outcome is a Nash equilibrium.

Minimax method The minimax method will arrive at the same equilibrium as using dominance criteria. But it is limited to 0-sum games. This method may also fail to find an equilibrium, either because none exists (in pure strategies) or because there is more than one.

II. Cell-by-cell inspection Cell-by-cell inspection always works to find all Nash equilibria in pure strategies. But it can be tedious. Sometimes it is the only method that works. For each cell, ask whether either player has a unilateral incentive to move.

OPEC game OPEC is the row player, Non-OPEC oil producers the column Each can choose to produce at a high, medium, or low level Highest profits if you produce at a higher level than others; but overproduction lowers profits.

OPEC game HighMediumLow High60, 6036, 7036, 35 Medium70, 3650, 5030, 35 Low35, 3635, 3025, 25

III. Three players Consider a 3-person PD Player 1 will choose row, 2 column

Three players Player 3 chooses: CooperateDefect CD C5, 5, 53, 6, 3 D6, 3, 34, 4, 1 CD C3, 3, 61, 4, 4 D4, 1, 42, 2, 2

IV. Multiple or no equilibria Multiple equilibria games are usually known in IR as coordination problems. If there is more than one Nash equilibrium, the players need to find a way to agree on which will prevail.

Coordination problems Can think of coordination problems as being differentiated by how much conflict of interest there is in the game. –Do all agree on which equilibrium is the best? –Or do they disagree? Three important examples: Assurance, chicken, battle of the sexes

Assurance (or stag hunt) RefrainBuild Refrain4, 41, 3 Build3, 12, 2

Assurance In assurance games, players should be able to get to their preferred outcome unless one is uncertain that the other really has assurance preferences. If this weren’t a concern, could just unilaterally disarm. Might solve with a focal point that leads to a convergence of expectations.

Chicken Back downFight Back down0, 0-1, 1 Fight1, -1-2, -2

Chicken Here, the player who can make a commitment first will win – for example, throwing the steering wheel out of the window. But if both make commitments, leads to disaster.

Battle of the sexes (or two cultures) AB A2, 10, 0 B 1, 2

No Nash equilibrium in pure strategies Sometimes no matter which outcome is chosen, one player has an incentive to move away from it This means there is no Nash equilibrium in pure strategies. The essence of such a game is that there is a benefit to being unpredictable.

No Nash equilibrium in pure strategies AB A2, 33, 2 B4, 11, 4

No Nash equilibrium in pure strategies Games like this might arise between a defender and an attacker; if the defender knows what the attacker is going to do, can take advantage of it. So the solution is to be unpredictable; to choose moves randomly.

No Nash equilibrium in pure strategies To play randomly, don’t pick any move with certainty, but have a probability distribution over the possible moves. This is called a mixed strategy. Schelling: in situations like this, want to keep your opponent guessing; this is more likely true in zero-sum games.

V. Cooperation, coordination, and competition in international politics Simple 2x2 games like these have been used extensively in the study of IR. Basic problems of IR are: cooperation, coordination, and competition. When does each occur? What kind of framework allows solution of each?

Strategic form games and IR Example of an important argument: the type of international framework needed to deal with particular issues depends on the underlying game being played. In PD, players have a common interest in cooperation but incentives to defect. This is a typical collective-goods problem; also used for trade, arms control.

Strategic form games and IR So, in a PD, need a framework to provide monitoring and sanctioning. This can be done with international institutions; they can facilitate collaboration as the state does on the domestic level.

Strategic form games and IR Coordination problems mean that some outcomes are disliked by all actors. But there is a multiple equilibrium problem, and possibly disagreement on which equilibrium is preferred. Here, a regime would only need to identify a focal point; no need for enforcement.

Strategic form games and IR This use of games to generate predictions about the type of regime that states will create is an example of what BdM calls a structural theory. Domestic politics doesn’t matter much; states treated as the units of analysis. But not neorealist.

Strategic form games and IR So, this approach is more like what BdM calls liberal theory, since the focus is on maximizing wealth, the role of regimes, and collective action problems. But, BdM wrong to claim that liberal theory assumes hierarchy. Anarchy is just lack of external enforcement.

Strategic form games and IR If anarchy is lack of external enforcement, meets the assumptions of non-cooperative game theory. The problem is to search for equilibria that are self-enforcing. BdM brings in repetition and information; will get to these.

Strategic form games and IR Can also use simple games to generate predictions about likelihood for conflict or cooperation. What types of games are most likely to give rise to recurrent conflict? To cooperation? How do games map onto different issue-areas?

Strategic form games and IR Schelling introduces communication. Seems to use strategic-form games, but discussion is about sequential moves. Strategic moves: the use of promises or threats. Major point: the capacity to communicate (or not) is essential to how a game will be played.

Communication To really understand the role of communication, would have to explicitly add moves that allow for communication; analysis of this is a supergame. Paradox arises: players are often better off if they can’t receive messages.