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,

Slides:



Advertisements
Similar presentations
N-Player Games. A symmetric N-person game. 1)All players have same strategy sets 2)If you switch two players strategies, you switch their payoffs and.
Advertisements

Mixed Strategies.
Game Theory Lecture 4 Game Theory Lecture 4.
Monte Hall Problem Let’s Draw a Game Tree… Problem 6, chapter 2.
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?
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Extensive and Strategic Form Games Econ 171. Reminder: Course requirements Class website Go to economics department home page. Under Links, find Class.
PlayerFirst choice Second Choice Third Choice Fourth Choice Fifth Choice Boromir FrodoNobodyLegolasGimli FrodoNobodyBoromirLegolas FrodoNobodyGimliBoromir.
Game theory (Sections )
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
Bayesian Games Yasuhiro Kirihata University of Illinois at Chicago.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
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.
Eponine Lupo.  Questions from last time  3 player games  Games larger than 2x2—rock, paper, scissors  Review/explain Nash Equilibrium  Nash Equilibrium.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Non-cooperative Games Elon Kohlberg February 2, 2015.
Game Theory Developed to explain the optimal strategy in two-person interactions. Initially, von Neumann and Morganstern Zero-sum games John Nash Nonzero-sum.
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.
Multi-player, non-zero-sum games
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
An Introduction to Game Theory Part I: Strategic Games
Games with Simultaneous Moves I :Discrete Strategies
Introduction to Nash Equilibrium Presenter: Guanrao Chen Nov. 20, 2002.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
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.
Slide 1 of 13 So... What’s Game Theory? Game theory refers to a branch of applied math that deals with the strategic interactions between various ‘agents’,
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
Basics on Game Theory For Industrial Economics (According to Shy’s Plan)
Review: Game theory Dominant strategy Nash equilibrium
Dominant strategies Econ 171. Clicker Question 1, 3 5, 3 2, 4 7, 2 Player 2 Strategy A Strategy B Player 1 Strategy A Strategy B A ) Strategy A strictly.
Nash Equilibrium Econ 171. Suggested Viewing A Student’s Suggestion: Video game theory lecture Open Yale Economics Ben Pollack’s Game Theory Lectures.
Extensive Form Games Econ 171. Reminder: Course requirements Class website Go to economics department home page. Under Links, find Class pages, then click.
Lecture Slides Dixit and Skeath Chapter 4
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.
DANSS Colloquium By Prof. Danny Dolev Presented by Rica Gonen
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
CPS 170: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
Dominant strategies. Clicker Question 1, 3 5, 3 2, 4 7, 2 Player 2 Strategy A Strategy B Player 1 Strategy A Strategy B A ) Strategy A strictly dominates.
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.
Worlds with many intelligent agents An important consideration in AI, as well as games, distributed systems and networking, economics, sociology, political.
Bayes-Nash equilibrium with Incomplete Information.
Games People Play. 9: Collective-Action Games In collective-action games the interests of society and the individuals are in conflict.
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.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
Punishment, Detection, and Forgiveness in Repeated Games.
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.
Subgames and Credible Threats (with perfect information) Econ 171.
CPS 570: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
Normal Form Games, Normal Form Games, Rationality and Iterated Rationality and Iterated Deletion of Dominated Strategies Deletion of Dominated Strategies.
Game theory (Sections )
Subgames and Credible Threats
Subgames and Credible Threats. Nuclear threat USSR Don’t Invade Hungary 0101 Invade US Give in Bomb USSR
Subgames and Credible Threats. Russian Tanks Quell Hungarian Revolution of 1956.
Games of pure conflict two-person constant sum games.
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
Games, Strategies, and Decision Making By Joseph Harrington, Jr. First Edition Chapter 4: Stable Play: Nash Equilibria in Discrete Games with Two or Three.
Advanced Subjects in GT Outline of the tutorials Static Games of Complete Information Introduction to games Normal-form (strategic-form) representation.
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
Check your (Mis)understanding?
Simultaneous Move Games: Discrete Strategies
UNIT 4. SOCIAL INTERACTIONS
Choices Involving Strategy
UNIT II: The Basic Theory
Phase transitions to cooperation in the prisoner‘s dilemma
Presentation transcript:

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, otherwise you will get 0 points… A) 6 B) 5 C) 4 D) 3 E) 2 Clicker Game:

Iterated Deletion of Dominated Strategies Would a smart player choose 6? If you believe that everybody in the class is smart, would you ever choose 5? If you believe that everybody in the class is smart and believes everybody else is smart, what would you conclude? What if you take this another step?

Nash Equilibrium The real John NashHollywood’s Version

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? A) Yes B) No

Nash Equilibrium in Chicken Game? 0, 0 0, 1 1, 0 -10, -10 Swerve Hang Tough Swerve Hang Tough Player 2 Pllayer 1 How many Nash equilibria does this game have? A)None B)Exactly one C)More than one

Definition A strategy profile is a Nash Equilibrium if each player’s strategy maximizes his payoff given the strategies used by the other players.

Clicker Question 6,03,24,1 2,3 2,8 1,12,05,2 Player 1 Strategy A1 Strategy B1 Strategy C1 Strategy A2 Stategy B2 Strategy C2 Is the outcome where Player 1 plays B1 and Player 2 plays C2 a Nash equilibrium? A)Yes B)No

Clicker Question 6,03,24,1 2,3 2,8 1,12,05,2 Player 1 Strategy A1 Strategy B1 Strategy C1 Strategy A2 Stategy B2 Strategy C2 Is the outcome where Player 1 plays A1 and Player 2 plays B2 a Nash equilibrium? A)Yes B)No

Best response mapping Best response for a player is a mapping from actions by the others to the action (or actions) that maximizes the player’s payoffs given the actions of the others. In Nash equilibrium, every player is doing the best response to what the other players are doing.

Prisoners’ Dilemma Game 10, 10 0, 11 11, 0 1, 1 CooperateDefect Cooperate Defect PLAyER 1 PLAyER 1 Player 2

Battle of Sexes 2,1 0,0 1,2 Bob Alice Movie A Movie B Movie A Movie B BR A (A)=A BR A (B)=B BR B (A)=A BR B (B)=B

Best Responses and Nash Equilibria for this game? BR 2 (a)=z BR 1 (w)=b BR 2 (b)={w,x,z} BR 1 (x)=b BR 2 (c)=y BR 1 (y)=b BR 2 (d)={y,z} BR 1 (z)={a,d}

Find Nash equilibria for these games Chicken Pure coordination (Driving Game)

How many Nash equilibria (in pure strategies)? There might be just one. There might be more than one. There might not be any.

Rock, Paper Scissors, Where is Nash equilibrium?

When is Nash equilibrium “the right answer”? 1.Players are “rational”. Each player’s strategy maximizes his payoff, given his beliefs about the strategies used by the other players. 2.Each player’s beliefs about the other players’ strategies are correct. When is 2) a reasonable assumption?

3-Hunter Stag Hunt 2,2,20,1,0 1,0,01,1,0 Hunter 3 does Stag Hunter 3 does Hare Hunter 2 StagHare Stag Hare Hunter 1 0,0,10,1,1 1,0,11,1,1 Hunter 2 Stag Hare Stag Hare Find the Nash equilibria Hunter 1

Weakly dominated strategies? Nobody will use a strictly dominated strategy in Nash equilibrium. If there is a strictly dominant strategy for all players, it is a Nash equilibrium. (example Prisoners’ Dilemma.) Nash equilibrium does not exclude possibility of using a weakly dominated strategy. (A voting example with unanimous preferences.)

Nash and domination Every Nash equilibrium survives the iterated elimination of strictly dominated strategies. Not every outcome that satisfies the iterated elimination of strictly dominated strategies is a Nash equilibrium.

Clicker Question 6,03,24,1 2,3 2,8 1,12,05,2 Player 1 Strategy A1 Strategy B1 Strategy C1 Strategy A2 Stategy B2 Strategy C2 Does this game have more than one Nash equilibrium? A)Yes B)No

Game of previous slide reduced by IDSDS Strategy B2Strategy C2 Strategy A13,24,1 Strategy C12,05,2 Find the Nash equiibria for reduced game. These must be Nash equilibria for the original game. Note that strategy profiles C1,B2 and A1,C2 are not Eliminated by IDSDS, but are not Nash equillibria.

Clicker Question: What are the Nash Equilibria for this game? A) Player 1 plays a and Player 2 plays z. B)Player 1 plays d and Player 2 plays z. C)Player 1 plays b and Player 2 plays y. D)Both outcomes A) and B) are Nash equilibria. E)There are no Nash equilibria 4,1

A coordination game You choose one of three parties to go to Party X, Party Y, Party Z You like big parties and your payoff will be the number of people who attend the same party that you do. We will play this repeatedly with clickers. After each round, you will see how many people chose each option. Then you play again.

Which Party do you choose? A) Party Y B) Party X C) Party Z

Remember to Your On

Fictional play version You do the best response given the average of previous responses. Will this converge? If it converges, it converges to Nash equilibrium. Why?