Spring 2014 Quiz: 10 points Answer Key 2/19/14 Time Limit: 53 Minutes (FAS students: Teaching Assistant. Total Point Value: 10 points.

Similar documents
1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1

Multi-player, non-zero-sum games

THEORY: NASH EQUILIBRIUM

NORMAL FORM (SIMULTANEOUS MOVE) GAMES

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

Lecture #3: Networks. Kyumars Sheykh Esmaili

ECON 282 Final Practice Problems

EC3224 Autumn Lecture #02 Nash Equilibrium

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

Microeconomics of Banking: Lecture 4

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

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

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

Prisoner 2 Confess Remain Silent Confess (-5, -5) (0, -20) Remain Silent (-20, 0) (-1, -1)

0.1 Battle of the Sexes. 0.2 Chicken. 0.3 Coordination Game

Game theory. Logic and Decision Making Unit 2

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

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

Lecture 5: Subgame Perfect Equilibrium. November 1, 2006

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

CMU-Q Lecture 20:

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

The extensive form representation of a game

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

LECTURE 26: GAME THEORY 1

Strategies and Game Theory

Chapter 13. Game Theory

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

Terry College of Business - ECON 7950

The book goes through a lot of this stuff in a more technical sense. I ll try to be plain and clear about it.

Two-Person General-Sum Games GAME THEORY II. A two-person general sum game is represented by two matrices and. For instance: If:

Game Theory. Vincent Kubala

Finance Solutions to Problem Set #8: Introduction to Game Theory

Session Outline. Application of Game Theory in Economics. Prof. Trupti Mishra, School of Management, IIT Bombay

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

Extensive-Form Games with Perfect Information

Game Theory. Vincent Kubala

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

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

DYNAMIC GAMES. Lecture 6

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

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

FIRST PART: (Nash) Equilibria

Game Theory. Wolfgang Frimmel. Dominance

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

Repeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler)

Extensive Games with Perfect Information A Mini Tutorial

International Economics B 2. Basics in noncooperative game theory

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

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice.

ECO 463. SimultaneousGames

Games of Perfect Information and Backward Induction

Homework 5 Answers PS 30 November 2013

Game Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.

Game Theory. Wolfgang Frimmel. Subgame Perfect Nash Equilibrium

Games in Extensive Form, Backward Induction, and Subgame Perfection:

CS510 \ Lecture Ariel Stolerman

Distributed Optimization and Games

(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

DECISION MAKING GAME THEORY

DR. SARAH ABRAHAM CS349 UNINTENDED CONSEQUENCES

Chapter 30: Game Theory

"Students play games while learning the connection between these games and Game Theory in computer science or Rock-Paper-Scissors and Poker what s

ECON 301: Game Theory 1. Intermediate Microeconomics II, ECON 301. Game Theory: An Introduction & Some Applications

Terry College of Business - ECON 7950

Part 1. Midterm exam PS 30 November 2012

Lect 15:Game Theory: the math of competition

[ Game Theory ] A short primer

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo

Appendix A A Primer in Game Theory

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

Signaling Games

Introduction to Game Theory

Computational Methods for Non-Cooperative Game Theory

Economics 201A - Section 5

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

Japanese. Sail North. Search Search Search Search

Nash Equilibrium. An obvious way to play? Player 1. Player 2. Player 2

Noncooperative Games COMP4418 Knowledge Representation and Reasoning

RECITATION 8 INTRODUCTION

Introduction. Begin with basic ingredients of a game. optimisation equilibrium. Frank Cowell: Game Theory Basics. July

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo

Lecture 13(ii) Announcements. Lecture on Game Theory. None. 1. The Simple Version of the Battle of the Sexes

COORDINATION GAMES. Nash Equilibria, Schelling Points and the Prisoner s Dilemma. Owain Evans, MIT Paradox, Monday 25 February 2013.

Simultaneous-Move Games: Mixed Strategies. Games Of Strategy Chapter 7 Dixit, Skeath, and Reiley

Introduction to Game Theory I

Copyright 2008, Yan Chen

14.12 Game Theory Lecture Notes Lectures 10-11

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

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

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

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

Introduction Economic Models Game Theory Models Games Summary. Syllabus

3 Game Theory II: Sequential-Move and Repeated Games

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.

Introduction to IO. Introduction to IO

Introduction to Game Theory

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

Mixed Strategies; Maxmin

G5212: Game Theory. Mark Dean. Spring 2017

Transcription:

Gov 40 Spring 2014 Quiz: 10 points Answer Key 2/19/14 Time Limit: 53 Minutes (FAS students: 11:07-12) Name (Print): Teaching Assistant Total Point Value: 10 points. Your Grade: Please enter all requested information on the top of this page, and put your initials on the top of every page, in case the pages become separated. You may not use your books, notes, or any calculator on this exam. If you need more space, use the extra page; clearly indicate when you have done this and label any extensions.

Gov 40 Quiz: 10 points Answer Key - Page 2 of 8 2/19/14 1. PART 1: ANSWER ALL MULTIPLE CHOICE QUESTIONS. For each multiple choice question please select the correct choice. There is only one correct choice, answer each question in this section. Each question worth.5 points. 2.5 points total for this section. (a) Anarchy and conflicting interests are insufficient to cause war among rational actors in the bargaining model because: (a) Anarchy is what states make of it (b) War is costly (c) It assumes states are unitary actors (d) States can effectively communicate with each other (b) What is the commitment problem of an alliance? (a) It is questionable whether member states will uphold the terms of the alliance. (b) Member states may not actually sign an alliance treaty. (c) Once an alliance treaty is signed, it is questionable whether it will be ratified. (d) It is difficult to tell which alliances really exist and which ones are fictional. (e) It is often not clear in an alliance who can declare war. (c) Imagine a Prisoner s Dilemma game is switched to be a sequential game instead of a simultaneous move game. What would the equilibrium be in this scenario (a) First player defects, second player defects (b) First player cooperates, second player defects (c) First player defects, second player cooperates (d) First player cooperates, second player cooperates (d) An outcome is Pareto efficient when: (a) one player can be made better off (b) it is impossible to make any player better off without making someone else worse off (c) no player has an incentive to unilaterally deviate from this solution (d) when each player s strategy is his or her best response to the predicted strategies of opponents (e) The following is an example of a Chicken Game: (a) Cuban Missile Crisis (b) The US-USSR arms race (c) Setting anti-deflation policy (d) Signing a global environmental treaty

Gov 40 Quiz: 10 points Answer Key - Page 3 of 8 2/19/14 2. PART II: ANSWER ALL GAME QUESTIONS. Find all pure strategy Nash equilibria by circling the outcome, and label the type of game the diagram represents. Answer each question in this section. 1 point each. 3 points total for this section. Figure 1: What game is this? You answer here: Prisoner s Dilemma Partner L R U (4, 10) (1, 11) You D (12, 1) (4,4). Figure 2: What game is this? You answer here: Stag Hunt Partner L R U (6,5) (1, 4) You D (4, 0) (2,2).

Gov 40 Quiz: 10 points Answer Key - Page 4 of 8 2/19/14 Figure 3: What game is this? You answer here: Prisoner s Dilemma Partner L R U (7, 7) (0, 9) You D (8, 0) (2,3). 3. What are the three causal logics Fearon identifies to explain war despite its cost and risk? 1 point 1. Private information and the incentives to misrepresent 2. Commitment problems 3. Indivisible issues

Gov 40 Quiz: 10 points Answer Key - Page 5 of 8 2/19/14 4. In order for a country to communicate information about their cost of war to an opponent, what must they do and why? 1.5 points What they must do: Send a costly signal. One example might be mobilizing troops. Why: States have incentives to misrepresent (understate) their costs of war to improve their bargaining outcomes. These incentives make communication noncredible unless it is costly.

Gov 40 Quiz: 10 points Answer Key - Page 6 of 8 2/19/14 5. Consider the single round bargaining game we studied in class. State A and B are engaged in a one round bargaining problem over a resource worth 100 units. State A can demand x A. If the demand is accepted by B then the resource is divided according to this rule. If it is rejected, causing war, then State A wins the entire resource with probability p =.4. If war occurs, there is a one time cost of c a = 10, c b = 20. What is the range of bargaining outcomes that both sides will prefer to war? 1 point. Let R=Resource From B s Perspective: B s payoff to war = B s payoff to bargaining R(1 p) c B = R-x 100(1-.4)-20= 100-x x=60 From A s Perspective: A s payoff to war = A s payoff to bargaining R(p) c A = x 100(.4)-10= x x=30 Therefore, the bargaining range is 30 to 60.

Gov 40 Quiz: 10 points Answer Key - Page 7 of 8 2/19/14 6. Consider now a similar game but where there are two rounds of bargaining. State A and B are engaged in a two round bargaining problem over a resource worth 100 units per round. In the first round, state A can demand x 1A. If the demand is accepted by B then the resource is divided according to this rule. If it is rejected, causing war, then State A wins the entire resource with probability p 1 =.2. The actor that wins the war gets the entire resource in the second period. If war occurs, there is a one time cost of c a = 20, c b = 20. If the second round is reached, the probability State A wins the entire resource following a rejected demand is p 2 =.9. Show, using the step by step analysis procedure used in class, that every demand is rejected in the first round. Make sure to explain key points of reasoning. 1 point. To solve this problem, use backward induction with A solving for the optimal offers to make B indifferent between war and peace. Let R=Resource Round 2: B s payoff to war = B s payoff to bargaining R(1 p 2 ) c B = R-x 2 100(1-.9)-20= 100-x 2 x 2 =110 This means A can keep the whole resource (x 2 =100) for itself in Round 2. (Note: we still gave full credit for using 110 here, in which case the final answer comes out to be x 1 = -50.) Round 1: B s payoff to war = B s payoff to bargaining R(1 p 1 ) c B + R(1 p 1 ) = R-x 1 + R-x 2 100(1-.2)-20 + 100(1-.2)= 100-x 1 + 100-100 x 1 = -40 Because this is negative, there is no offer that will be accepted, and there will be preventive war in the first round.

Gov 40 Quiz: 10 points Answer Key - Page 8 of 8 2/19/14 EXTRA CREDIT: Prof. Tingley in lecture referenced a specific retaliatory strategy against a roommate that is dirty. What is this strategy? (.5 pt., full credit only) Leave your dirty laundry everywhere too this is a tit for tat strategy.