Lecture 23. Offense vs. Defense & Dynamic Games

Size: px
Start display at page:

Download "Lecture 23. Offense vs. Defense & Dynamic Games"

Transcription

1 Lecture 3. Offense vs. Defense & Dynamic Games EC DD & EE / Manove Offense vs Defense p EC DD & EE / Manove Clicker Question p

2 Using Game Theory to Analyze Offense versus Defense In many competitive situations the offense of one competitor battles the defense of the other. If the defense matches the offense, then the defense wins. If not, the offense wins. EC DD & EE / Manove Offense vs Defense p 3 Example: Military Strategies Example: Business Strategies EC DD & EE / Manove Offense vs Defense>Examples p 4

3 EC DD & EE / Manove Matching Pennies Matching pennies is a game-theory model of offense-versus-defense. In this example, Eva plays Eva offense; Esther plays defense. Esther H T T Eva and Esther each puts a penny on the table at the same time. If Esther matches Eva (both heads or both tails), then Eva pays Esther $. But if Esther fails to match Eva (one heads, one tails) Esther pays Eva $ This is called a zero-sum game, because whatever amount one player wins, the other must lose. The game has no Nash equilibrium with pure (non randomized) strategies. Offense vs Defense>Matching Pennies p 5 H EC DD & EE / Manove Clicker Question p 6

4 Dynamic Games So far, we ve analyzed static games, in which all players move at the same time. Now we will examine dynamic games, in which players move at different times. Dynamic Game Example: Airline fares British Airways sets its Boston-London fares. Then, Delta Airlines sets its Boston-London fares. EC DD & EE / Manove Dynamic Games p 7 The Battle of the Sexes: Static Version emember the Battle of the Sexes? wants to go to a football match, but wants to go to the opera. If they both do, then gets utility, and gets, and if they both do, then gets and gets. But if they do different things, then both get. Both must choose their strategies at the same time, without knowing what the other has done. There are two Nash equilibria:, and,. EC DD & EE / Manove Dynamic Games>Battle of the Sexes p 8

5 The Battle of the Sexes: Dynamic Version Now suppose that the players move at different times, first one, then the other. or example, suppose that moves first: she buys a ticket for either the football match or the opera. She shows her ticket, so he knows what she has done. Then moves: he buys his ticket for either the football match or the opera. EC DD & EE / Manove Dynamic Games>Battle of the Sexes p 9 What would happen in this game? The answer is clear! (the selfish beast ) will choose football and force to choose football as well., still looks like a Nash equilibrium. We know they won t choose,, but is, still an equilibrium? To find out, we must model strategies properly. If moves first, and see the result before he moves, then the matrix above does not correctly represent the game. EC DD & EE / Manove Dynamic Games>Battle of the Sexes p???

6 Dynamic-Game Strategies A strategy is a complete plan of action that specifies what a player will do in every circumstance that she can observe. rom what strategies does choose? and (as before). What about? What are his strategy choices? and are NOT strategies for. A strategy is a plan that might tell you to do different things in each situation you know about. knows has bought or bought. So his strategy must reflect his knowledge of her action. EC DD & EE / Manove Dynamic Games>Strategies p s possible strategy choices are the following (with my own nicknames): : If she bought, I will choose. If she bought, I will choose. Copy : If she bought, I will choose. If she bought, I will choose. Opposite : If she bought, I will choose. If she bought, I will choose. : If she bought, I will choose. If she bought, I will choose. These four strategies form s strategy space. EC DD & EE / Manove Dynamic Games>Strategies p

7 epresenting the Dynamic Game The dynamic Battle of the Sexes can be represented as follows: Copy Notice that if does, then s strategies and Copy require the same actions and lead to the same payoffs. EC DD & EE / Manove Dynamic Games>Normal orm p 3 But what are the Nash equilibria of this game? If we check each cell, we can see that there are exactly 3 pure-strategy equilibria: Copy Opposite Opposite,, Copy, In each equilibrium, the players have no incentive at the beginning of the game to deviate from their chosen strategies. However, it turns out that only, Copy is formed from strategies (plans) that would actually be followed during the game. What s wrong with the strategies in the other equilibria? Answer: They are not time-consistent EC DD & EE / Manove Dynamic Games>Equilibria p 4

8 Course Evaluations Now we ll do the course evaluations. The lecture will continue afterwards. The entire evaluation (except for Q4) is about M. Manove. The Ts will distribute their own evaluations. Q5: Substitute for the original question: I found the clicker questions useful. EC DD & EE / Manove Course Evaluations p 5 EC DD & EE / Manove Clicker Question p 6

9 Time Consistency A strategy is a plan of action that specifies what a player will do in every circumstance that she can observe. Think of a strategy as a plan made at the beginning of the game. The strategy is time-consistent if the player is willing to follow her plan as the game progresses. Example: Your strategy is to study economics tonight even if your roommate is having a party, but when the party begins, you succumb to temptation and decide not to study. Your strategy was not time-consistent. EC DD & EE / Manove Dynamic Games>Time Consistency p 7 In our Battle-Sexes example, buys her ticket first. But if says he will go to opera no matter what does, wouldn t be forced to buy an opera ticket?, is a Nash equilibrium! Copy Opposite Maybe would ignore s statement! suspects that if she chooses, will change?? his mind about. She thinks: might choose when he s planning his strategy at the beginning of the game, but when it s his turn to buy a ticket, may be unwilling to follow the - plan if I have chosen. may be an idle threat (that will not carry out), a threat that doesn t believe. EC DD & EE / Manove Dynamic Games>Time Consistency p 8

10 A New Kind of Equilibrium In general, the Nash equilibrium does not guarantee that equilibrium strategies will be time consistent, because the Nash-equilibrium concept doesn t eliminate idle threats. However, there s a special kind of Nash equilibrium that does guarantee time-consistent equilibrium strategies: the subgame-perfect Nash equilibrium. EC DD & EE / Manove Dynamic Games>Time Consistency p 9 Normal-orm and Extensive-orm Games So far, we ve described games with a matrix in which each row or column represents a player s strategy: the normal-form game. But to find a subgame-perfect Nash equilibrium we need a different game structure: the extensive-form game. We ll explain the extensive-form game in the next lecture, and we ll use it to find an equilibrium with time-consistent strategies. EC DD & EE / Manove Dynamic Games>Time Consistency p

11 EC DD & EE / Manove Clicker Question p End of ile EC DD & EE / Manove End of ile p

Lecture 24. Extensive-Form Dynamic Games

Lecture 24. Extensive-Form Dynamic Games Lecture 4. Extensive-orm Dynamic Games Office Hours this week at usual times: Tue 5:5-6:5, ri - Practice inal Exam available on course website. A Graded Homework is due this Thursday at 7pm. EC DD & EE

More information

Microeconomics of Banking: Lecture 4

Microeconomics of Banking: Lecture 4 Microeconomics of Banking: Lecture 4 Prof. Ronaldo CARPIO Oct. 16, 2015 Administrative Stuff Homework 1 is due today at the end of class. I will upload the solutions and Homework 2 (due in two weeks) later

More information

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 Problem 1 UPenn NETS 412: Algorithmic Game Theory Game Theory Practice Bonnie Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 This game is called Prisoner s Dilemma. Bonnie and Clyde have been

More information

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Additional readings could be assigned from time to time. They are an integral part of the class and you are expected to read

More information

DECISION MAKING GAME THEORY

DECISION MAKING GAME THEORY DECISION MAKING GAME THEORY THE PROBLEM Two suspected felons are caught by the police and interrogated in separate rooms. Three cases were presented to them. THE PROBLEM CASE A: If only one of you confesses,

More information

Lecture #3: Networks. Kyumars Sheykh Esmaili

Lecture #3: Networks. Kyumars Sheykh Esmaili Lecture #3: Game Theory and Social Networks Kyumars Sheykh Esmaili Outline Games Modeling Network Traffic Using Game Theory Games Exam or Presentation Game You need to choose between exam or presentation:

More information

Game Theory. (4) What would you choose if your partner chooses Heads? (5) What would you choose if your partner chooses Tails?

Game Theory. (4) What would you choose if your partner chooses Heads? (5) What would you choose if your partner chooses Tails? Game Theory The UCI Math Circle Penny Game Now you and your partner play the penny game, each of you can choose either heads or tails. You can get one candy from your partner if your choices are the same.

More information

FIRST PART: (Nash) Equilibria

FIRST PART: (Nash) Equilibria FIRST PART: (Nash) Equilibria (Some) Types of games Cooperative/Non-cooperative Symmetric/Asymmetric (for 2-player games) Zero sum/non-zero sum Simultaneous/Sequential Perfect information/imperfect information

More information

(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1

(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1 Economics 109 Practice Problems 2, Vincent Crawford, Spring 2002 In addition to these problems and those in Practice Problems 1 and the midterm, you may find the problems in Dixit and Skeath, Games of

More information

Economics 201A - Section 5

Economics 201A - Section 5 UC Berkeley Fall 2007 Economics 201A - Section 5 Marina Halac 1 What we learnt this week Basics: subgame, continuation strategy Classes of games: finitely repeated games Solution concepts: subgame perfect

More information

Computing Nash Equilibrium; Maxmin

Computing Nash Equilibrium; Maxmin Computing Nash Equilibrium; Maxmin Lecture 5 Computing Nash Equilibrium; Maxmin Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Computing Mixed Nash Equilibria 3 Fun Game 4 Maxmin and Minmax Computing Nash

More information

Mixed Strategies; Maxmin

Mixed Strategies; Maxmin Mixed Strategies; Maxmin CPSC 532A Lecture 4 January 28, 2008 Mixed Strategies; Maxmin CPSC 532A Lecture 4, Slide 1 Lecture Overview 1 Recap 2 Mixed Strategies 3 Fun Game 4 Maxmin and Minmax Mixed Strategies;

More information

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include: The final examination on May 31 may test topics from any part of the course, but the emphasis will be on topic after the first three homework assignments, which were covered in the midterm. Topics from

More information

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Game Theory for Fun and Profit The Beauty Contest Game Write your name and an integer between 0 and 100 Let

More information

1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col.

1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col. I. Game Theory: Basic Concepts 1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col. Representation of utilities/preferences

More information

Student Name. Student ID

Student Name. Student ID Final Exam CMPT 882: Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte Student Name Student ID Instructions. This exam is worth 30% of your final mark in this course.

More information

NORMAL FORM (SIMULTANEOUS MOVE) GAMES

NORMAL FORM (SIMULTANEOUS MOVE) GAMES NORMAL FORM (SIMULTANEOUS MOVE) GAMES 1 For These Games Choices are simultaneous made independently and without observing the other players actions Players have complete information, which means they know

More information

Computational Methods for Non-Cooperative Game Theory

Computational Methods for Non-Cooperative Game Theory Computational Methods for Non-Cooperative Game Theory What is a game? Introduction A game is a decision problem in which there a multiple decision makers, each with pay-off interdependence Each decisions

More information

Game Theory. Wolfgang Frimmel. Subgame Perfect Nash Equilibrium

Game Theory. Wolfgang Frimmel. Subgame Perfect Nash Equilibrium Game Theory Wolfgang Frimmel Subgame Perfect Nash Equilibrium / Dynamic games of perfect information We now start analyzing dynamic games Strategic games suppress the sequential structure of decision-making

More information

Static or simultaneous games. 1. Normal Form and the elements of the game

Static or simultaneous games. 1. Normal Form and the elements of the game Static or simultaneous games 1. Normal Form and the elements of the game Simultaneous games Definition Each player chooses an action without knowing what the others choose. The players move simultaneously.

More information

Games of Perfect Information and Backward Induction

Games of Perfect Information and Backward Induction Games of Perfect Information and Backward Induction Economics 282 - Introduction to Game Theory Shih En Lu Simon Fraser University ECON 282 (SFU) Perfect Info and Backward Induction 1 / 14 Topics 1 Basic

More information

ECON 282 Final Practice Problems

ECON 282 Final Practice Problems ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How

More information

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium ECO 220 Game Theory Simultaneous Move Games Objectives Be able to structure a game in normal form Be able to identify a Nash equilibrium Agenda Definitions Equilibrium Concepts Dominance Coordination Games

More information

Introduction to Auction Theory: Or How it Sometimes

Introduction to Auction Theory: Or How it Sometimes Introduction to Auction Theory: Or How it Sometimes Pays to Lose Yichuan Wang March 7, 20 Motivation: Get students to think about counter intuitive results in auctions Supplies: Dice (ideally per student)

More information

Network-building. Introduction. Page 1 of 6

Network-building. Introduction. Page 1 of 6 Page of 6 CS 684: Algorithmic Game Theory Friday, March 2, 2004 Instructor: Eva Tardos Guest Lecturer: Tom Wexler (wexler at cs dot cornell dot edu) Scribe: Richard C. Yeh Network-building This lecture

More information

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly Relevant readings from the textbook: Mankiw, Ch. 17 Oligopoly Suggested problems from the textbook: Chapter 17 Questions for

More information

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/4/14

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/4/14 600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/4/14 25.1 Introduction Today we re going to spend some time discussing game

More information

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100% percent expected to attend

More information

Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1

Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1 Game Theory Intro Lecture 3 Game Theory Intro Lecture 3, Slide 1 Lecture Overview 1 What is Game Theory? 2 Game Theory Intro Lecture 3, Slide 2 Non-Cooperative Game Theory What is it? Game Theory Intro

More information

Lecture 3: Nash Equilibrium

Lecture 3: Nash Equilibrium Microeconomics I: Game Theory Lecture 3: Nash Equilibrium (see Osborne, 2009, Sect 2.1-2.7) Dr. Michael Trost Department of Applied Microeconomics November 8, 2013 Dr. Michael Trost Microeconomics I: Game

More information

Analyzing Games: Mixed Strategies

Analyzing Games: Mixed Strategies Analyzing Games: Mixed Strategies CPSC 532A Lecture 5 September 26, 2006 Analyzing Games: Mixed Strategies CPSC 532A Lecture 5, Slide 1 Lecture Overview Recap Mixed Strategies Fun Game Analyzing Games:

More information

Nash Equilibrium. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS 503

Nash Equilibrium. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS 503 Nash Equilibrium Felix Munoz-Garcia School of Economic Sciences Washington State University EconS 503 est Response Given the previous three problems when we apply dominated strategies, let s examine another

More information

Economics II: Micro Winter 2009 Exercise session 4 Aslanyan: VŠE

Economics II: Micro Winter 2009 Exercise session 4 Aslanyan: VŠE Economics II: Micro Winter 2009 Exercise session 4 slanyan: VŠE 1 Review Game of strategy: player is engaged in a game of strategy if that individual s payo (utility) is determined not by that individual

More information

ECO 5341 Strategic Behavior Lecture Notes 3

ECO 5341 Strategic Behavior Lecture Notes 3 ECO 5341 Strategic Behavior Lecture Notes 3 Saltuk Ozerturk SMU Spring 2016 (SMU) Lecture Notes 3 Spring 2016 1 / 20 Lecture Outline Review: Dominance and Iterated Elimination of Strictly Dominated Strategies

More information

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium. Problem Set 3 (Game Theory) Do five of nine. 1. Games in Strategic Form Underline all best responses, then perform iterated deletion of strictly dominated strategies. In each case, do you get a unique

More information

Game Theory. 4: Nash equilibrium in different games and mixed strategies

Game Theory. 4: Nash equilibrium in different games and mixed strategies Game Theory 4: Nash equilibrium in different games and mixed strategies Review of lecture three A game with no dominated strategy: The battle of the sexes The concept of Nash equilibrium The formal definition

More information

International Economics B 2. Basics in noncooperative game theory

International Economics B 2. Basics in noncooperative game theory International Economics B 2 Basics in noncooperative game theory Akihiko Yanase (Graduate School of Economics) October 11, 2016 1 / 34 What is game theory? Basic concepts in noncooperative game theory

More information

MS&E 246: Lecture 15 Perfect Bayesian equilibrium. Ramesh Johari

MS&E 246: Lecture 15 Perfect Bayesian equilibrium. Ramesh Johari MS&E 246: ecture 15 Perfect Bayesian equilibrium amesh Johari Dynamic games In this lecture, we begin a study of dynamic games of incomplete information. We will develop an analog of Bayesian equilibrium

More information

EC3224 Autumn Lecture #02 Nash Equilibrium

EC3224 Autumn Lecture #02 Nash Equilibrium Reading EC3224 Autumn Lecture #02 Nash Equilibrium Osborne Chapters 2.6-2.10, (12) By the end of this week you should be able to: define Nash equilibrium and explain several different motivations for it.

More information

Game Theory for Strategic Advantage Alessandro Bonatti MIT Sloan

Game Theory for Strategic Advantage Alessandro Bonatti MIT Sloan Game Theory for Strategic Advantage 15.025 Alessandro Bonatti MIT Sloan Look Forward, Think Back 1. Introduce sequential games (trees) 2. Applications of Backward Induction: Creating Credible Threats Eliminating

More information

Game Theory Week 1. Game Theory Course: Jackson, Leyton-Brown & Shoham. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Week 1

Game Theory Week 1. Game Theory Course: Jackson, Leyton-Brown & Shoham. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Week 1 Game Theory Week 1 Game Theory Course: Jackson, Leyton-Brown & Shoham A Flipped Classroom Course Before Tuesday class: Watch the week s videos, on Coursera or locally at UBC Hand in the previous week s

More information

Game Theory. 6 Dynamic Games with imperfect information

Game Theory. 6 Dynamic Games with imperfect information Game Theory 6 Dynamic Games with imperfect information Review of lecture five Game tree and strategies Dynamic games of perfect information Games and subgames ackward induction Subgame perfect Nash equilibrium

More information

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should

More information

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18 601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18 24.1 Introduction Today we re going to spend some time discussing game theory and algorithms.

More information

Backward Induction and Stackelberg Competition

Backward Induction and Stackelberg Competition Backward Induction and Stackelberg Competition Economics 302 - Microeconomic Theory II: Strategic Behavior Shih En Lu Simon Fraser University (with thanks to Anke Kessler) ECON 302 (SFU) Backward Induction

More information

THEORY: NASH EQUILIBRIUM

THEORY: NASH EQUILIBRIUM THEORY: NASH EQUILIBRIUM 1 The Story Prisoner s Dilemma Two prisoners held in separate rooms. Authorities offer a reduced sentence to each prisoner if he rats out his friend. If a prisoner is ratted out

More information

CS510 \ Lecture Ariel Stolerman

CS510 \ Lecture Ariel Stolerman CS510 \ Lecture04 2012-10-15 1 Ariel Stolerman Administration Assignment 2: just a programming assignment. Midterm: posted by next week (5), will cover: o Lectures o Readings A midterm review sheet will

More information

Lecture 6: Basics of Game Theory

Lecture 6: Basics of Game Theory 0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 6: Basics of Game Theory 25 November 2009 Fall 2009 Scribes: D. Teshler Lecture Overview 1. What is a Game? 2. Solution Concepts:

More information

Computational Aspects of Game Theory Bertinoro Spring School Lecture 2: Examples

Computational Aspects of Game Theory Bertinoro Spring School Lecture 2: Examples Computational Aspects of Game Theory Bertinoro Spring School 2011 Lecturer: Bruno Codenotti Lecture 2: Examples We will present some examples of games with a few players and a few strategies. Each example

More information

Chapter 13. Game Theory

Chapter 13. Game Theory Chapter 13 Game Theory A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes. You can t outrun a bear, scoffs the camper. His friend coolly replies, I don

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Part 1. Static games of complete information Chapter 1. Normal form games and Nash equilibrium Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas V. Filipe

More information

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies. Section Notes 6 Game Theory Applied Math 121 Week of March 22, 2010 Goals for the week be comfortable with the elements of game theory. understand the difference between pure and mixed strategies. be able

More information

Homework 5 Answers PS 30 November 2013

Homework 5 Answers PS 30 November 2013 Homework 5 Answers PS 30 November 2013 Problems which you should be able to do easily 1. Consider the Battle of the Sexes game below. 1a 2, 1 0, 0 1b 0, 0 1, 2 a. Find all Nash equilibria (pure strategy

More information

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016 Econ 302: Microeconomics II - Strategic Behavior Problem Set #5 June13, 2016 1. T/F/U? Explain and give an example of a game to illustrate your answer. A Nash equilibrium requires that all players are

More information

Game Theory -- Lecture 6. Patrick Loiseau EURECOM Fall 2016

Game Theory -- Lecture 6. Patrick Loiseau EURECOM Fall 2016 Game Theory -- Lecture 6 Patrick Loiseau EURECOM Fall 06 Outline. Stackelberg duopoly and the first mover s advantage. Formal definitions 3. Bargaining and discounted payoffs Outline. Stackelberg duopoly

More information

Terry College of Business - ECON 7950

Terry College of Business - ECON 7950 Terry College of Business - ECON 7950 Lecture 3: Sequential-Move Games Primary reference: Dixit and Skeath, Games of Strategy, Ch. 3. Games Without Dominant Strategies Many games do not have dominant strategies.

More information

Self-interested agents What is Game Theory? Example Matrix Games. Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1

Self-interested agents What is Game Theory? Example Matrix Games. Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1 Game Theory Intro Lecture 3 Game Theory Intro Lecture 3, Slide 1 Lecture Overview 1 Self-interested agents 2 What is Game Theory? 3 Example Matrix Games Game Theory Intro Lecture 3, Slide 2 Self-interested

More information

Game Theory and Randomized Algorithms

Game Theory and Randomized Algorithms Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international

More information

Sequential games. Moty Katzman. November 14, 2017

Sequential games. Moty Katzman. November 14, 2017 Sequential games Moty Katzman November 14, 2017 An example Alice and Bob play the following game: Alice goes first and chooses A, B or C. If she chose A, the game ends and both get 0. If she chose B, Bob

More information

Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan

Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan For All Practical Purposes Two-Person Total-Conflict Games: Pure Strategies Mathematical Literacy in Today s World, 9th ed. Two-Person

More information

Basic Game Theory. Economics Auction Theory. Instructor: Songzi Du. Simon Fraser University. September 7, 2016

Basic Game Theory. Economics Auction Theory. Instructor: Songzi Du. Simon Fraser University. September 7, 2016 Basic Game Theory Economics 383 - Auction Theory Instructor: Songzi Du Simon Fraser University September 7, 2016 ECON 383 (SFU) Basic Game Theory September 7, 2016 1 / 7 Game Theory Game theory studies

More information

Problem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1

Problem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1 Solutions for Homework 2 Networked Life, Fall 204 Prof Michael Kearns Due as hardcopy at the start of class, Tuesday December 9 Problem (5 points: Graded by Shahin) Recall the network structure of our

More information

Multi-player, non-zero-sum games

Multi-player, non-zero-sum games Multi-player, non-zero-sum games 4,3,2 4,3,2 1,5,2 4,3,2 7,4,1 1,5,2 7,7,1 Utilities are tuples Each player maximizes their own utility at each node Utilities get propagated (backed up) from children to

More information

Mohammad Hossein Manshaei 1394

Mohammad Hossein Manshaei 1394 Mohammad Hossein Manshaei manshaei@gmail.com 394 Some Formal Definitions . First Mover or Second Mover?. Zermelo Theorem 3. Perfect Information/Pure Strategy 4. Imperfect Information/Information Set 5.

More information

PARALLEL NASH EQUILIBRIA IN BIMATRIX GAMES ISAAC ELBAZ CSE633 FALL 2012 INSTRUCTOR: DR. RUSS MILLER

PARALLEL NASH EQUILIBRIA IN BIMATRIX GAMES ISAAC ELBAZ CSE633 FALL 2012 INSTRUCTOR: DR. RUSS MILLER PARALLEL NASH EQUILIBRIA IN BIMATRIX GAMES ISAAC ELBAZ CSE633 FALL 2012 INSTRUCTOR: DR. RUSS MILLER WHAT IS GAME THEORY? Branch of mathematics that deals with the analysis of situations involving parties

More information

4. Game Theory: Introduction

4. Game Theory: Introduction 4. Game Theory: Introduction Laurent Simula ENS de Lyon L. Simula (ENSL) 4. Game Theory: Introduction 1 / 35 Textbook : Prajit K. Dutta, Strategies and Games, Theory and Practice, MIT Press, 1999 L. Simula

More information

Game Theory: Normal Form Games

Game Theory: Normal Form Games Game Theory: Normal Form Games CPSC 322 Lecture 34 April 3, 2006 Reading: excerpt from Multiagent Systems, chapter 3. Game Theory: Normal Form Games CPSC 322 Lecture 34, Slide 1 Lecture Overview Recap

More information

Extensive Games with Perfect Information A Mini Tutorial

Extensive Games with Perfect Information A Mini Tutorial Extensive Games withperfect InformationA Mini utorial p. 1/9 Extensive Games with Perfect Information A Mini utorial Krzysztof R. Apt (so not Krzystof and definitely not Krystof) CWI, Amsterdam, the Netherlands,

More information

The extensive form representation of a game

The extensive form representation of a game The extensive form representation of a game Nodes, information sets Perfect and imperfect information Addition of random moves of nature (to model uncertainty not related with decisions of other players).

More information

Perfect Bayesian Equilibrium

Perfect Bayesian Equilibrium Perfect Bayesian Equilibrium When players move sequentially and have private information, some of the Bayesian Nash equilibria may involve strategies that are not sequentially rational. The problem is

More information

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown, Slide 1 Lecture Overview 1 Domination 2 Rationalizability 3 Correlated Equilibrium 4 Computing CE 5 Computational problems in

More information

Introduction to IO. Introduction to IO

Introduction to IO. Introduction to IO Basic Concepts in Noncooperative Game Theory Actions (welfare or pro ts) Help us to analyze industries with few rms What are the rms actions? Two types of games: 1 Normal Form Game 2 Extensive Form game

More information

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi CSCI 699: Topics in Learning and Game Theory Fall 217 Lecture 3: Intro to Game Theory Instructor: Shaddin Dughmi Outline 1 Introduction 2 Games of Complete Information 3 Games of Incomplete Information

More information

Math 464: Linear Optimization and Game

Math 464: Linear Optimization and Game Math 464: Linear Optimization and Game Haijun Li Department of Mathematics Washington State University Spring 2013 Game Theory Game theory (GT) is a theory of rational behavior of people with nonidentical

More information

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory Resource Allocation and Decision Analysis (ECON 8) Spring 4 Foundations of Game Theory Reading: Game Theory (ECON 8 Coursepak, Page 95) Definitions and Concepts: Game Theory study of decision making settings

More information

Game Theory. 4: Nash equilibrium in different games and mixed strategies

Game Theory. 4: Nash equilibrium in different games and mixed strategies Game Theory 4: Nash equilibrium in different games and mixed strategies Review of lecture three A game with no dominated strategy: The battle of the sexes The concept of Nash equilibrium The formal definition

More information

ECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES. Representation Tree Matrix Equilibrium concept

ECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES. Representation Tree Matrix Equilibrium concept CLASSIFICATION ECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES Sequential Games Simultaneous Representation Tree Matrix Equilibrium concept Rollback (subgame

More information

This is Games and Strategic Behavior, chapter 16 from the book Beginning Economic Analysis (index.html) (v. 1.0).

This is Games and Strategic Behavior, chapter 16 from the book Beginning Economic Analysis (index.html) (v. 1.0). This is Games and Strategic Behavior, chapter 16 from the book Beginning Economic Analysis (index.html) (v. 1.0). This book is licensed under a Creative Commons by-nc-sa 3.0 (http://creativecommons.org/licenses/by-nc-sa/

More information

8.F The Possibility of Mistakes: Trembling Hand Perfection

8.F The Possibility of Mistakes: Trembling Hand Perfection February 4, 2015 8.F The Possibility of Mistakes: Trembling Hand Perfection back to games of complete information, for the moment refinement: a set of principles that allow one to select among equilibria.

More information

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction 1 Intermediate Microeconomics W3211 ecture 20: Game Theory 2 Introduction Columbia University, Spring 2016 Mark Dean: mark.dean@columbia.edu 2 The Story So Far. 3 Today 4 ast lecture we began to study

More information

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I Topics The required readings for this part is O chapter 2 and further readings are OR 2.1-2.3. The prerequisites are the Introduction

More information

CSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1

CSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1 CSC304 Lecture 2 Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1 Game Theory How do rational, self-interested agents act? Each agent has a set of possible actions Rules of the game: Rewards for the

More information

Exercises for Introduction to Game Theory SOLUTIONS

Exercises for Introduction to Game Theory SOLUTIONS Exercises for Introduction to Game Theory SOLUTIONS Heinrich H. Nax & Bary S. R. Pradelski March 19, 2018 Due: March 26, 2018 1 Cooperative game theory Exercise 1.1 Marginal contributions 1. If the value

More information

INSTRUCTIONS: all the calculations on the separate piece of paper which you do not hand in. GOOD LUCK!

INSTRUCTIONS: all the calculations on the separate piece of paper which you do not hand in. GOOD LUCK! INSTRUCTIONS: 1) You should hand in ONLY THE ANSWERS ASKED FOR written clearly on this EXAM PAPER. You should do all the calculations on the separate piece of paper which you do not hand in. 2) Problems

More information

Chapter 3 Learning in Two-Player Matrix Games

Chapter 3 Learning in Two-Player Matrix Games Chapter 3 Learning in Two-Player Matrix Games 3.1 Matrix Games In this chapter, we will examine the two-player stage game or the matrix game problem. Now, we have two players each learning how to play

More information

Sequential Games When there is a sufficient lag between strategy choices our previous assumption of simultaneous moves may not be realistic. In these

Sequential Games When there is a sufficient lag between strategy choices our previous assumption of simultaneous moves may not be realistic. In these When there is a sufficient lag between strategy choices our previous assumption of simultaneous moves may not be realistic. In these settings, the assumption of sequential decision making is more realistic.

More information

Noncooperative Games COMP4418 Knowledge Representation and Reasoning

Noncooperative Games COMP4418 Knowledge Representation and Reasoning Noncooperative Games COMP4418 Knowledge Representation and Reasoning Abdallah Saffidine 1 1 abdallah.saffidine@gmail.com slides design: Haris Aziz Semester 2, 2017 Abdallah Saffidine (UNSW) Noncooperative

More information

EconS Game Theory - Part 1

EconS Game Theory - Part 1 EconS 305 - Game Theory - Part 1 Eric Dunaway Washington State University eric.dunaway@wsu.edu November 8, 2015 Eric Dunaway (WSU) EconS 305 - Lecture 28 November 8, 2015 1 / 60 Introduction Today, we

More information

Extensive Form Games and Backward Induction

Extensive Form Games and Backward Induction Recap Subgame Perfection ackward Induction Extensive Form ames and ackward Induction ISCI 330 Lecture 3 February 7, 007 Extensive Form ames and ackward Induction ISCI 330 Lecture 3, Slide Recap Subgame

More information

Terry College of Business - ECON 7950

Terry College of Business - ECON 7950 Terry College of Business - ECON 7950 Lecture 5: More on the Hold-Up Problem + Mixed Strategy Equilibria Primary reference: Dixit and Skeath, Games of Strategy, Ch. 5. The Hold Up Problem Let there be

More information

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides Game Theory ecturer: Ji iu Thanks for Jerry Zhu's slides [based on slides from Andrew Moore http://www.cs.cmu.edu/~awm/tutorials] slide 1 Overview Matrix normal form Chance games Games with hidden information

More information

Game theory. Logic and Decision Making Unit 2

Game theory. Logic and Decision Making Unit 2 Game theory Logic and Decision Making Unit 2 Introduction Game theory studies decisions in which the outcome depends (at least partly) on what other people do All decision makers are assumed to possess

More information

Part 1. Midterm exam PS 30 November 2012

Part 1. Midterm exam PS 30 November 2012 Last name First name Student ID number Part 1 Midterm exam PS 30 November 2012 This is a closed book exam. The only thing you can take into this exam is yourself and writing instruments. No calculators,

More information

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players). Game Theory Refresher Muriel Niederle February 3, 2009 1. Definition of a Game We start by rst de ning what a game is. A game consists of: A set of players (here for simplicity only 2 players, all generalized

More information

Mixed strategy Nash equilibrium

Mixed strategy Nash equilibrium Mixed strategy Nash equilibrium Felix Munoz-Garcia Strategy and Game Theory - Washington State University Looking back... So far we have been able to nd the NE of a relatively large class of games with

More information

Basic Solution Concepts and Computational Issues

Basic Solution Concepts and Computational Issues CHAPTER asic Solution Concepts and Computational Issues Éva Tardos and Vijay V. Vazirani Abstract We consider some classical games and show how they can arise in the context of the Internet. We also introduce

More information

Games. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Games. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Games Episode 6 Part III: Dynamics Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Dynamics Motivation for a new chapter 2 Dynamics Motivation for a new chapter

More information

Solution Concepts 4 Nash equilibrium in mixed strategies

Solution Concepts 4 Nash equilibrium in mixed strategies Solution Concepts 4 Nash equilibrium in mixed strategies Watson 11, pages 123-128 Bruno Salcedo The Pennsylvania State University Econ 402 Summer 2012 Mixing strategies In a strictly competitive situation

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Part 2. Dynamic games of complete information Chapter 4. Dynamic games of complete but imperfect information Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas

More information

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy ECON 312: Games and Strategy 1 Industrial Organization Games and Strategy A Game is a stylized model that depicts situation of strategic behavior, where the payoff for one agent depends on its own actions

More information