Game Theory Part 5: Nash’s Theorem.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Module 4 Game Theory To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
APPENDIX An Alternative View of the Payoff Matrix n Assume total maximum profits of all oligopolists is constant at 200 units. n Alternative policies.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Two-Player Zero-Sum Games
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
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.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
An Introduction to... Evolutionary Game Theory
Porter's 5 Forces POTENTIAL ENTRANTS SUPPLIERS BUYERS SUBSTITUTES INDUSTRY COMPETITORS Rivalry Among Existing Firms.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Game theory.
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.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)
Game Theory. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.
Game Theory Game theory is an attempt to model the way decisions are made in competitive situations. It has obvious applications in economics. But it.
Chapter 15- Game Theory: The Mathematics of Competition
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
Part 3: The Minimax Theorem
Game Theory Jacob Foley. PUfyk PUfyk
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Game Theory.
OLIGOPOLY AND GAME THEORY Phillip J Bryson Marriott School, BYU.
Game Theory And Competition Strategies
An Introduction to Game Theory Part I: Strategic Games
GAME THEORY.
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.
Game Theory Analysis Sidney Gautrau. John von Neumann is looked at as the father of modern game theory. Many other theorists, such as John Nash and John.
The Prisoner’s Dilemma -Both arrested during botched bank robbery. -Kept in separate cells – NO COMMUNICATION. -Offered separate deals if they confess.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Abstract Though previous explorations of equilibria in game theory have incorporated the concept of error-making, most do not consider the possibility.
Lecture Slides Dixit and Skeath Chapter 4
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Game Applications Chapter 29. Nash Equilibrium In any Nash equilibrium (NE) each player chooses a “best” response to the choices made by all of the other.
Game Theory Objectives:
Game Theory.
Today: Some classic games in game theory
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
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.
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.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
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.
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.
Lec 23 Chapter 28 Game Theory.
Entry Deterrence Players Two firms, entrant and incumbent Order of play Entrant decides to enter or stay out. If entrant enters, incumbent decides to fight.
Game Theory Dr. Andrew L. H. Parkes “Economics for Business (2)” 卜安吉.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Game theory Chapter 28 and 29
Microeconomics Course E
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Introduction to Game Theory
Game theory Chapter 28 and 29
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture Game Theory.
MinMax Theorem John von Neumann
Game Theory: The Nash Equilibrium
Presentation transcript:

Game Theory Part 5: Nash’s Theorem

Nash’s Theorem Any n-player variable-sum matrix game has at least one equilibrium point.

Comparing Theorems Here are the two most important theorems of game theory… Minimax Theorem Proved by Von Neumann in 1928. States that any 2-player zero-sum matrix game has exactly one unique equilibrium point (which is always a saddle point). Nash’s Theorem Proved by John Nash in 1951. States that any n-player variable-sum matrix game has at least one equilibrium point.

Nash’s Theorem Now, because of Nash’s Theorem, given any matrix game, no matter how many players, no matter how many strategies, no matter if it’s a zero-sum game or a variable-sum game, we know there is at least one equilibrium point. We can say that Nash’s theorem provides a generalization of the Minimax theorem. That is, the Minimax theorem is a special case of Nash’s theorem, where n = 2 players and the game is zero-sum. In that special case, we know there is exactly one equilibrium point and in that case the equilibrium point is also a saddle point. According to Nash’s theorem, there is always at least one equilibrium point in any matrix game. We will see that in variable-sum games, there may be more than one equilibrium point. Also, just like with the Minimax Theorem, any equilibrium point in variable-sum games may be in mixed strategies.

Saddle Points and Equilibrium Points A saddle point is the combination of strategies in which each player can find the highest possible payoff assuming the best possible play by the opponent. An equilibrium point (also called a Nash equilibrium point) is the combination of strategies in which no player has any benefit from changing strategies assuming that the opponent (or opponents) do not change strategies. Every saddle point is an equilibrium point but not every equilibrium point is a saddle point. A saddle point occurs when each player is achieving the highest possible payoff and thus neither would benefit from changing strategies if the other didn’t also change - which is why it is also called an equilibrium point. However, there are equilibrium points in variable sum games where the players are not achieving the best possible payoff (so they aren’t saddle points) but neither will benefit by changing their strategy assuming the other doesn’t also change their strategy – which is why they are called equilibrium points.

Important Variable Sum Games There are two important well known 2-player variable-sum matrix games which must be discussed in any introduction to game theory… Prisoner’s Dilemma Chicken Confess Not Confess (2,2) (4,1) (1,4) (3,3) Swerve Not Swerve (3,3) (2,4) (4,2) (1,1)

Prisoner’s Dilemma Prisoner #2 Confess Not Confess (2,2) (4,1) (1,4) (3,3) Prisoner #1 The police catch two suspects. They are kept for questioning. Each has the following dilemma: to confess or not to confess. Suppose the prisoner’s are unable to communicate and must make a decision without knowing what the other decided. What is in the best interest of each player?

Prisoner’s Dilemma Prisoner #2 Confess Not Confess (2,2) (4,1) (1,4) (3,3) Prisoner #1 Notice that the dominant strategy for both players is to confess. Unfortunately, for them, this implies the equilibrium point is in both confessing. Of course, both would be better of by not confessing, but not knowing what the other player’s strategy will be, forces each into playing their dominant strategy.

Prisoner’s Dilemma Equilibrium point Prisoner #2 Confess Not Confess (2,2) (4,1) (1,4) (3,3) Prisoner #1 Notice that the dominant strategy for both players is to confess. Unfortunately, for them, this implies the equilibrium point is in both confessing. Of course, both would be better of by not confessing, but not knowing what the other player’s strategy will be, forces each into playing their dominant strategy.

Prisoner’s Dilemma – Example 2: an arms race Country #2 Continue to Arm Respect Treaty (2,2) (4,1) (1,4) (3,3) Country #1 Prisoner’s Dilemma can be used to model an arms race between two countries. Suppose each sign a treaty to stop any military build-up. It could be in each country’s best interest to respect the treaty, assuming the other does as well, because, for example, instead of financing an arms-race the countries could invest in social programs or other interests. However, each could fear that the other country will break the treaty and continue to arm.

Prisoner’s Dilemma – Example 2: an arms race Country #2 Continue to Arm Respect Treaty (2,2) (4,1) (1,4) (3,3) Country #1 Suppose, for example, that Country #1 chose to respect the treaty while Country #2 continued to arm. Then Country #1 would be at a disadvantage as Country #1 continues to build military strength. For this game, the equilibrium point is where each country continues to arm. Of course, this is the reason each country would expect inspections of the other’s arms as part of any acceptable treaty.

Chicken Player #2 The name derives from a situation in which two players drive straight toward each other. Each player considers it the greatest payoff not to swerve away but to force the other to “chicken out” and swerve. Of course, the worst payoff is if neither swerves and they crash into each other. swerve do not swerve (3,3) (2,4) (4,2) (1,1) Player #1 Does either player have a dominant strategy? The answer is no – neither player has a dominant and neither has a dominated strategy. However, there are two equilibrium points in pure strategies (and one in mixed strategies).

Chicken Equilibrium point #1 Player #2 The two pure strategy equilibrium points in this game are: Equilibrium point #1 Player 1 – swerve Player 2 – do not swerve And … swerve do not swerve (3,3) (2,4) (4,2) (1,1) Player #1

Chicken Player #2 The two pure strategy equilibrium points in this game are: Equilibrium point #1 Player 1 – swerve Player 2 – do not swerve And Equilibrium point #2 Player 1 – do not swerve Player 2 – swerve swerve do not swerve (3,3) (2,4) (4,2) (1,1) Player #1 Equilibrium point #2

Chicken Player #2 Why are these two points equilibrium points ? If there are equilibrium points in pure strategies, even when no player has a dominant strategy, we can find these points as follows… swerve do not swerve (3,3) (2,4) (4,2) (1,1) Player #1 To find equilibrium points when there are no dominate strategies in variable sum games, consider the payoffs at each outcome: We ask, given one player’s choice of the strategy resulting in that outcome, does the other player have any benefit in changing strategy?

Chicken Player #2 Considering each outcome: (3,3) is not at an equilibrium point because given player 2’s choice of swerve, player 1 would benefit by switching to the do not swerve strategy. (4,2) is at an equilibrium point because given player 2’s choice of swerve, player 1 does not benefit by switching to swerve. swerve do not swerve (3,3) (2,4) (4,2) (1,1) Player #1 (2,4) is also at an equilibrium point because given player 1’s choice of swerve, then player 2 will not benefit from switching to do not swerve. Finally, (1,1) is not an equilibrium point because for both player’s given the other’s choice of do not swerve, each player can benefit by switching strategy to swerve.

Chicken Player #2 The equilibrium points occur in this game in this way because of the way in which payoffs are distributed… While neither player has a dominant strategy, the payoff of not swerving when the other does is higher than both swerving. Both players risk the outcome (1,1) because of the potential of the higher payoff at (4,2) or (2,4). swerve do not swerve (3,3) (2,4) (4,2) (1,1) Player #1 The reason the equilibrium point is at (2,4) and (4,2) and not at (3,3) is because the strategies at (3,3) are not stable. Both players have an incentive to change to the do not swerve strategy in hopes of getting the higher payoff.

Chicken USSR The Cuban missile crisis can be modeled by the game of chicken. In the 1960s, the USSR began supplying missiles to Cuba. The United States began a blockade to stop the USSR. back down proceed (3,3) (2,4) (4,2) (0,0) U.S. As the crisis developed, if each had continued to proceed with their chosen strategy, the consequences could have been disastrous. Fortunately, some last minute negotiations averted such an outcome. The U.S. did not have to back down and the USSR was able to achieve some advantage in other interests.