Non-cooperative Games Elon Kohlberg February 2, 2015.

Slides:



Advertisements
Similar presentations
Mixed Strategies.
Advertisements

Game Theory Lecture 4 Game Theory Lecture 4.
Monte Hall Problem Let’s Draw a Game Tree… Problem 6, chapter 2.
Midterm Scores 20 points per question Grade RangeScoreNumber of students in this range A B C D F
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Two Player Zero-Sum Games
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?
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
Mixed Strategies For Managers
Two-Player Zero-Sum Games
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
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.
Working Some Problems. Telephone Game How about xexed strategies? Let Winnie call with probability p and wait with probability 1-p. For what values of.
The Evolution of Conventions H. Peyton Young Presented by Na Li and Cory Pender.
An Introduction to Game Theory Part I: Strategic Games
Games with Simultaneous Moves I :Discrete Strategies
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
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.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
The Structure of Networks
Nash equilibrium and Best Response Functions
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.
Non-cooperative Game Theory Notes by Alberto Bressan.
Intro to Game Theory Revisiting the territory we have covered.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Yale 9&10 Mixed Strategies in Theory and Tennis. Overview As I randomize the strategies, the expected payoff is a weighted average of the pure strategies.
January 20 Lecture Econ 171. The game of matching pennies has A)two pure strategy Nash equilibria B)One pure strategy Nash equilibrium C)One mixed strategy.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
Nash Equilibrium Econ 171. Suggested Viewing A Student’s Suggestion: Video game theory lecture Open Yale Economics Ben Pollack’s Game Theory Lectures.
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.
Game Theory Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents. Been used to study –Market.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT III: COMPETITIVE STRATEGY Monopoly Oligopoly Strategic Behavior 7/21.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Nash Equilibrium - definition A mixed-strategy profile σ * is a Nash equilibrium (NE) if for every player i we have u i (σ * i, σ * -i ) ≥ u i (s i, σ.
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
EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.
Games of Strategy (Game Theory) Topic 1 – Part IV.
Worlds with many intelligent agents An important consideration in AI, as well as games, distributed systems and networking, economics, sociology, political.
\ 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.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
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.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Mixed Strategies and Repeated Games
1. 2 Some details on the Simplex Method approach 2x2 games 2xn and mx2 games Recall: First try pure strategies. If there are no saddle points use mixed.
5.1.Static Games of Incomplete Information
1 The Volunteer’s Dilemma (Mixed Strategies). 2 The Volunteer Dilemma Game Simultaneously and independently, players have to decide if they wish to volunteer.
Games of pure conflict two-person constant sum games.
Replicator Dynamics. Nash makes sense (arguably) if… -Uber-rational -Calculating.
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,
Computation of Mixed Strategy Equilibria in Repeated Games Juho Timonen Instructor: PhD (Tech) Kimmo Berg Supervisor: Prof. Harri Ehtamo Saving.
9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.
Lecture III: Normal Form Games Recommended Reading: Dixit & Skeath: Chapters 4, 5, 7, 8 Gibbons: Chapter 1 Osborne: Chapters 2-4.
Working Some Problems.
Q 2.1 Nash Equilibrium Ben
Chapter 28 Game Theory.
Mixed Strategies Keep ‘em guessing.
Information, Control and Games
Replicator Dynamics.
Check your (Mis)understanding?
A useful reduction (SAT -> game)
GAME THEORY AND APPLICATIONS
Game Theory Chapter 12.
GAME THEORY AND APPLICATIONS
Presentation transcript:

Non-cooperative Games Elon Kohlberg February 2, 2015

Matching Pennies HT H1, -1-1, 1 T 1, -1 No Nash Equilibrium…

LR T 1, 00, 3 B 0, 12, 0

Mixed strategies are randomizations over the pure strategies – the rows or the columns 1-r L rRrR t T1, 00, 3 1-t B0, 12, 0 Player 1 chooses T with probability t Player 2 chooses R with probability r

LR T1, 00, 3 B0, 12, 0 Expected Payoffs to Player I: T:.4 * * 0 =.4 B:.4 * * 2 = 1.2 Best response to r=.6 is t=0, not t=.4 Try:.3 r=.6

2/3 L 1/3 R ¼ T1, 00, 3 ¾ B0, 12, 0 Expected payoff to Player I: T: 2/3 B: 2/3 T=1/4 is a best response Try: t=1/4 r=1/3 Expected payoff to Player II: L: 3/4 R: 3/4 R=1/3 is a best response

Indifference Principle: In a Nash equilibrium, all strategies that are assigned positive probability must have the same expected payoff. Proof If not, switch some weight from the lower expected payoff to the higher.

Indifference Principle: In a Nash equilibrium, all strategies that are assigned positive probability must have the same expected payoff. Q.Is this a sufficient condition for Nash equilibrium? No. One must also verify that no strategy assigned zero probability yields a higher payoff.

Indifference Principle: In a Nash equilibrium, all strategies that are assigned positive probability must have the same expected payoff. Q.Is this a sufficient condition for Nash equilibrium? No. One must also verify that no strategy assigned zero probability yields a higher payoff. Q. Are the two conditions sufficient for Nash equilibrium? Yes.

StrategyPayoff

Equations, based on the indifference principle: t > 0 and 1-t > 0 1-r = 2 r r = 1/3 r > 0 and 1-r > 0 1-t = 3t t = 1/4

Graphical Analysis Consider the best response graphs: As r goes from 0 to 1, draw the best response, t. As t goes from 0 to 1, draw the best response, r. Intersection?

Rationales for Mixed-strategy Equilibrium: 1.Self-enforcing beliefs 2.Frequency in a population 3.Intentional randomization

Battle of the Sexes FootballConcert Football2, 10, 0 Concert0, 01, 2 W M

Battle of the Sexes FootballConcert Football2, 10, 0 Concert0, 01, 2 W M Mixed-strategy equilibrium: M: 2/3 F; 1/3 C W: 1/3 F; 2/3 C

Battle of the Sexes FootballConcert Football4, 10, 0 Concert0, 01, 4 W M

Battle of the Sexes FootballConcert Football4, 10, 0 Concert0, 01, 4 W M Mixed-strategy equilibrium: M: 4/5 F; 1/5 C W: 1/5 F; 4/5 C

SwerveForward Swerve6, 64, 7 Forward7, 40, 0 Chicken

SwerveForward Swerve6, 64, 7 Forward7, 40, 0 Mixed-Strategy Equilibrium S=.8 F=.2 (Makes sense: Pure strategy equilibria require breaking the symmetry…) Probability of collision: 4% Chicken

SwerveForward Swerve6, 62, 12 Forward12, 20, 0 Chicken

SwerveForward Swerve6, 62, 12 Forward12, 20, 0 Chicken Mixed-Strategy Equilibrium S=.25 F=.75 Probability of collision: 56%

Stag Hunt StagHare Stag5, 50, 3 Hare3, 03, 3 The norm could be to go after the stag. The norm could be to go after the hare. Q.What is the meaning of the mixed-strategy equilibrium? Q. What probability does it assign to Stag? Q. How would this probability change if the value of a stag were 10 rather than 5?

Pollution Game CN C2, 2, 22, 3, 2 N3, 2, 20, 0, -1 CN C2, 2, 3-1, 0, 0 N0, -1, 00, 0, 0 II I I III C N

Pollution Game CN C2, 2, 22, 3, 2 N3, 2, 20, 0, -1 Pure- strategy Nash Equilibria (i)No one cleans (ii)Two out of three clean CN C2, 2, 3-1, 0, 0 N0, -1, 00, 0, 0 II I I III C N

Pollution Game CN C2, 2, 22, 3, 2 N3, 2, 20, 0, -1 Mixed- strategy Nash Equilibria (iii) One cleans for sure; other two clean with probability 2/3. (iv) Two symmetric equilibria. CN C2, 2, 3-1, 0, 0 N0, -1, 00, 0, 0 II I I III C N