SI 563 Homework 3 Oct 5, Determine the set of rationalizable strategies for each of the following games. a) X Y X Y Z

Similar documents
Test 1. ECON3161, Game Theory. Tuesday, September 25 th

preferences of the individual players over these possible outcomes, typically measured by a utility or payoff function.

Rationalizable Strategies

Mixed Strategy Nash Equilibrium. player 2

CMSC 474, Introduction to Game Theory 16. Behavioral vs. Mixed Strategies

Game Theory. Important Instructions

Jianfei Shen. School of Economics, The University of New South Wales, Sydney 2052, Australia

Game theory and applications: Lecture 1

Game Theory Notes: Examples of Games with Dominant Strategy Equilibrium or Nash Equilibrium

Solution to Tutorial 1

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts

Solution to Tutorial /2013 Semester I MA4264 Game Theory

Game Theory: Additional Exercises

Game Theory Problem Set 4 Solutions

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 5 Games and Strategy (Ch. 4)

1 R. 2 l r 1 1 l2 r 2

The Ohio State University Department of Economics Second Midterm Examination Answers

Chapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem

Player 2 H T T -1,1 1, -1

(a) (5 points) Suppose p = 1. Calculate all the Nash Equilibria of the game. Do/es the equilibrium/a that you have found maximize social utility?

Microeconomics Comprehensive Exam

CS711: Introduction to Game Theory and Mechanism Design

Prisoner s Dilemma. CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma. Prisoner s Dilemma. Prisoner s Dilemma.

(a) Describe the game in plain english and find its equivalent strategic form.

Economics 171: Final Exam

Games of Incomplete Information

ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games

Game Theory: Global Games. Christoph Schottmüller

CUR 412: Game Theory and its Applications Final Exam Ronaldo Carpio Jan. 13, 2015

Game Theory. VK Room: M1.30 Last updated: October 22, 2012.

MIDTERM ANSWER KEY GAME THEORY, ECON 395

Math 135: Answers to Practice Problems

Advanced Microeconomics

S 2,2-1, x c C x r, 1 0,0

ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves

Replicator Dynamics 1

Outline for today. Stat155 Game Theory Lecture 13: General-Sum Games. General-sum games. General-sum games. Dominated pure strategies

Problem Set 2 - SOLUTIONS

Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002

University of Hong Kong

Basic Game-Theoretic Concepts. Game in strategic form has following elements. Player set N. (Pure) strategy set for player i, S i.

CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma

Prisoner s dilemma with T = 1

M.Phil. Game theory: Problem set II. These problems are designed for discussions in the classes of Week 8 of Michaelmas term. 1

Mixed Strategies. Samuel Alizon and Daniel Cownden February 4, 2009

Overuse of a Common Resource: A Two-player Example

Microeconomics of Banking: Lecture 5

CUR 412: Game Theory and its Applications, Lecture 12

10.1 Elimination of strictly dominated strategies

In the Name of God. Sharif University of Technology. Microeconomics 2. Graduate School of Management and Economics. Dr. S.

MS&E 246: Lecture 5 Efficiency and fairness. Ramesh Johari

PAULI MURTO, ANDREY ZHUKOV. If any mistakes or typos are spotted, kindly communicate them to

Microeconomic Theory III Final Exam March 18, 2010 (80 Minutes)

Introduction. Microeconomics II. Dominant Strategies. Definition (Dominant Strategies)

Regret Minimization and Security Strategies

Introduction to Multi-Agent Programming

1 Solutions to Homework 4

Elements of Economic Analysis II Lecture X: Introduction to Game Theory

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017

ECON 803: MICROECONOMIC THEORY II Arthur J. Robson Fall 2016 Assignment 9 (due in class on November 22)

Duopoly models Multistage games with observed actions Subgame perfect equilibrium Extensive form of a game Two-stage prisoner s dilemma

Name. Answers Discussion Final Exam, Econ 171, March, 2012

An introduction on game theory for wireless networking [1]

Microeconomic Theory II Spring 2016 Final Exam Solutions

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012

Microeconomics Qualifying Exam

Agenda. Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection

Chapter 8. Repeated Games. Strategies and payoffs for games played twice

CMPSCI 240: Reasoning about Uncertainty

1. (15 points) P1 P2 P3 P4. GAME THEORY EXAM (with SOLUTIONS) January 2010

Spring 2017 Final Exam

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information

Introduction to game theory LECTURE 2

Answers to Problem Set 4

CUR 412: Game Theory and its Applications, Lecture 4

Beliefs and Sequential Rationality

CMPSCI 240: Reasoning about Uncertainty

CS 798: Homework Assignment 4 (Game Theory)

ECONS 424 STRATEGY AND GAME THEORY HANDOUT ON PERFECT BAYESIAN EQUILIBRIUM- III Semi-Separating equilibrium

Introduction to Game Theory

Solution Problem Set 2

Introduction to Game Theory

EconS 301 Intermediate Microeconomics. Review Session #13 Chapter 14: Strategy and Game Theory

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction

Expectations & Randomization Normal Form Games Dominance Iterated Dominance. Normal Form Games & Dominance

CSE 316A: Homework 5

Game Theory: Minimax, Maximin, and Iterated Removal Naima Hammoud

Lecture 1: Normal Form Games: Refinements and Correlated Equilibrium

MATH 4321 Game Theory Solution to Homework Two

Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing.

THE PENNSYLVANIA STATE UNIVERSITY. Department of Economics. January Written Portion of the Comprehensive Examination for

HW Consider the following game:

Auction is a commonly used way of allocating indivisible

SF2972 GAME THEORY Infinite games

Microeconomic Theory II Preliminary Examination Solutions

Simon Fraser University Fall Econ 302 D200 Final Exam Solution Instructor: Songzi Du Wednesday December 16, 2015, 8:30 11:30 AM

Bayesian Nash Equilibrium

PAULI MURTO, ANDREY ZHUKOV

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.

AS/ECON 2350 S2 N Answers to Mid term Exam July time : 1 hour. Do all 4 questions. All count equally.

Transcription:

SI 563 Homework 3 Oct 5, 06 Chapter 7 Exercise : ( points) Determine the set of rationalizable strategies for each of the following games. a) U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) X Y U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) b) Z U (,0) (,) (4,) M (3,4) (,) (,3) D (,3) (0,) (3,0) Note: for player strategy D is dominated by a mix strategy of 0.75U and 0.5M /

SI 563 Homework 3 Oct 5, 06 X Z U (,0) (4,) M (3,4) (,3) c) Z U (6,3) (5,) (0,) M (0,) (4,6) (6,0) D (,) (3,5) (,8) Note: for player strategy D is dominated by a mix strategy of 0.5U and 0.5M {(U, X)} d) Z U (8,6) (0,) (8,) M (,0) (,6) (5,) D (0,8) (,0) (4,4) Note: for player strategy D is dominated by a mix strategy of 0.5U and 0.5M U (8,6) (0,) M (,0) (,6) e) /

SI 563 Homework 3 Oct 5, 06 A (,) (0,0) B (0,0) (3,3) A (,) (0,0) B (0,0) (3,3) f) A (8,0) (4,) B (6,4) (8,5) A (8,0) (4,) B (6,4) (8,5) g) U (3,0) (4,) D (6,4) (8,5) {(8, 5)} 3 /

SI 563 Homework 3 Oct 5, 06 Exercise : ( point) Suppose that you manage a firm and are engaged in a dispute with one of your employees. The process of dispute resolution is modeled by the following game, where your employee chooses either to settle or to be tough in negotiation, and you choose either to hire an attorney or to give in. In the cells of the matrix, your payoff is listed second; x is a number that both you and the employee know. Under what conditions can you rationalize selection of give in? Explain what you must believe for this to be the case. you Give in Hire attorney Employee Settle (,) (0,) Be though (3,0) (x,) When x is bigger or equal to 0, for employee strategy Be though dominate strategy Settle. Then you will only choose Hire attorney because is bigger than 0, which is not the case mentioned in the question. When x is smaller than 0, there is no dominate strategies for either of the players. If you choose Hire attorney the expected payoff is always no matter which strategy employee choose. If you choose Give in, your expected payoff is p + 0 ( p) = p if we denote the probability of employee choosing Settle by p. In this case, the only reason you will rationalize selection of give in is x is smaller than 0 AND you believe that the probability that employee play Settle is greater than 0.5 (p > p > 0.5). Note: Since x=0 is the critical value, we won t deduct points if you include 0. 4 /

SI 563 Homework 3 Oct 5, 06 Chapter 9 Exercise : ( points) Consider the normal-form game pictured here: a b c w (5,) (3,4) (8,4) x (6,) (,3) (8,8) y (,) (0,) (9,) a) What are the Nash equilibria of this game? b) Which of these equilibria are efficient? a b c w (5,) (3,4) (8,4) x (6,) (,3) (8,8) y (,) (0,) (9,) a) After eliminated the strictly dominated strategies, we find Nash Equilibrium are (w, b) and (y, c) b) The strategy is (y, c) is efficient because no other solution at least better for one agent and not worse for the others. Exercise 3: ( points) Find the Nash equilibria of the games in Exercise of Chapter 7 a) 5 /

SI 563 Homework 3 Oct 5, 06 U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) There is no pure Nash equilibria strategy in this game. b) Z U (,0) (,) (4,) M (3,4) (,) (,3) D (,3) (0,) (3,0) Note: For player strategy D is dominated by a mix strategy of 0.5U and0.5m X Z U (,0) (4,) M (3,4) (,3) The Nash equilibrium are (M, X) and (U, Z) c) 6 /

SI 563 Homework 3 Oct 5, 06 Z U (6,3) (5,) (0,) M (0,) (4,6) (6,0) D (,) (3,5) (,8) {(U, X)} The Nash equilibria is (U, X) d) Z U (8,6) (0,) (8,) M (,0) (,6) (5,) D (0,8) (,0) (4,4) X Y The Nash equilibrium are (U, X) and (M, Y) U (8,6) (0,) M (,0) (,6) e) X Y A (,) (0,0) B (0,0) (3,3) 7 /

SI 563 Homework 3 Oct 5, 06 A (,) (0,0) The Nash equilibrium are (A, X) and (B, Y) B (0,0) (3,3) f) A (8,0) (4,) B (6,4) (8,5) A (8,0) (4,) B (6,4) (8,5) The Nash Equilibrium are (A, X) and (B, Y) g) U (3,0) (4,) D (6,4) (8,5) {(8, 5)} The Nash Equilibria is (D, Y) Chapter Exercise 4: ( points) 8 /

SI 563 Homework 3 Oct 5, 06 Compute the mix-strategy equilibria of the following games: A B A (,4) (0,0) p B (,6) (3,7) -p q -q Let p denote the probability that player plays strategy A and q denote the probability that player plays strategy A. For player : q + 0 ( q) = q + 3 ( q) q = 0.75 For player : p 4 + 6 ( p) = 0 p + 7 ( p) p = 0. The mix-strategy Nash equilibria is ((0.A, 0.8B), (0.75A, 0.5B)) L M R U (8,3) (3,5) (6,3) p C (3,3) (5,5) (4,8) -p D (5,) (3,7) (4,9) q -q After eliminated dominated strategy L and D, let p denote the probability that player plays strategy U and q denote the probability that player plays strategy M. For player : q 3 + 6 ( q) = 5 q + 4 ( q) q = 0.5 For player : p 5 + 5 ( p) = 3 p + 8 ( p) p = 0.6 The mix-strategy Nash equilibria is ((0.6U, 0.4C, 0D), (0, 0.5M, 0.5R)) Exercise 6: ( points) Determine all the Nash equilibria (pure-strategy and mixed strategy equilibria) of the following games. a) 9 / H T H (,-) (-,) p T (-,) (,-) -p

SI 563 Homework 3 Oct 5, 06 q -q Let p denote the probability that player plays strategy H and q denote the probability that player plays strategy H. For player : q + ( ) ( q) = q + ( q) q = 0.5 For player : p ( ) + ( p) = p + ( ) ( p) p = 0.5 There is no pure-strategy Nash equilibria, and there is a mix-strategy Nash equilibria is ((0.5H, 0.5T), (0.5H, 0.5T)) b) C D C (,) (0,3) D (3,0) (,) After eliminated dominated strategy C and D, there is one pure-strategy Nash equilibria (D, D), and there is no mix-strategy Nash equilibria. c) H D H (,) (3,) p D (3,) (,) -p q -q Let p denote the probability that player plays strategy H and q denote the probability that player plays strategy H. For player : q + 3 ( q) = 3 q + ( q) q = 0.5 For player : p + ( p) = p + ( p) p = 0.5 There is no pure-strategy Nash equilibria, and there is a mix-strategy Nash equilibria is ((0.5H, 0.5D), (0.5H, 0.5D)) d) A B A (,4) (,0) p 0 /

SI 563 Homework 3 Oct 5, 06 B (0,8) (3,9) -p q -q Let p denote the probability that player plays strategy A and q denote the probability that player plays strategy A. For player : q + ( q) = 0 q + 3 ( q) q = 0.5 For player : p 4 + 8 ( p) = 0 p + 9 ( p) p = 0. There are pure-strategy Nash equilibria (A, A) and (B, B), and there is a mix-strategy Nash equilibria is ((0.A, 0.8B), (0.5A, 0.5B)) /