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

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

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010

The Ohio State University Department of Economics Second Midterm Examination Answers

Problem Set 2 Answers

MIDTERM ANSWER KEY GAME THEORY, ECON 395

(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?

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

CS711: Introduction to Game Theory and Mechanism Design

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

Rationalizable Strategies

Handout on Rationalizability and IDSDS 1

Math 135: Answers to Practice Problems

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

These notes essentially correspond to chapter 13 of the text.

Problem Set 5 Answers

Game theory and applications: Lecture 1

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

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

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

Solution to Tutorial 1

EC202. Microeconomic Principles II. Summer 2009 examination. 2008/2009 syllabus

Solution to Tutorial /2013 Semester I MA4264 Game Theory

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

Game Theory Problem Set 4 Solutions

1 Intro to game theory

Some Problems. 3. Consider the Cournot model with inverse demand p(y) = 9 y and marginal cost equal to 0.

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

Midterm #2 EconS 527 [November 7 th, 2016]

Microeconomic Theory (501b) Comprehensive Exam

Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002

Game Theory: Global Games. Christoph Schottmüller

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

Introduction to Multi-Agent Programming

Econ 302 Assignment 3 Solution. a 2bQ c = 0, which is the monopolist s optimal quantity; the associated price is. P (Q) = a b

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

Economics 171: Final Exam

Games of Incomplete Information

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

Mixed Strategy Nash Equilibrium. player 2

Some Notes on Timing in Games

CMPSCI 240: Reasoning about Uncertainty

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

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

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

Problem Set 2 - SOLUTIONS

An introduction on game theory for wireless networking [1]

ODD. Answers to Odd-Numbered Problems, 4th Edition of Games and Information, Rasmusen PROBLEMS FOR CHAPTER 1

EconS Games with Incomplete Information II and Auction Theory

B w x y z a 4,4 3,3 5,1 2,2 b 3,6 2,5 6,-3 1,4 A c -2,0 2,-1 0,0 2,1 d 1,4 1,2 1,1 3,5

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

Bayesian Nash Equilibrium

MS&E 246: Lecture 2 The basics. Ramesh Johari January 16, 2007

Econ 711 Homework 1 Solutions

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

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

Exercises Solutions: Game Theory

Not 0,4 2,1. i. Show there is a perfect Bayesian equilibrium where player A chooses to play, player A chooses L, and player B chooses L.

CS711 Game Theory and Mechanism Design

Game Theory. Important Instructions

Econ 101A Final exam May 14, 2013.

EC202. Microeconomic Principles II. Summer 2011 Examination. 2010/2011 Syllabus ONLY

Problems on game theory and pricing practices (chapters 14 and 15)

Name: Midterm #1 EconS 425 (February 20 th, 2015)

Dynamic games with incomplete information

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

CMPSCI 240: Reasoning about Uncertainty

UCLA Department of Economics Ph. D. Preliminary Exam Micro-Economic Theory

Simon Fraser University Spring 2014

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

Notes for Section: Week 7

For Online Publication Only. ONLINE APPENDIX for. Corporate Strategy, Conformism, and the Stock Market

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

For on-line Publication Only ON-LINE APPENDIX FOR. Corporate Strategy, Conformism, and the Stock Market. June 2017

Solution Problem Set 2

Advanced Microeconomics Final Exam Winter 2011/2012

PROBLEM SET 6 ANSWERS

Final Examination December 14, Economics 5010 AF3.0 : Applied Microeconomics. time=2.5 hours

1 R. 2 l r 1 1 l2 r 2

Université du Maine Théorie des Jeux Yves Zenou Correction de l examen du 16 décembre 2013 (1 heure 30)

m 11 m 12 Non-Zero Sum Games Matrix Form of Zero-Sum Games R&N Section 17.6

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

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

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

Review Best Response Mixed Strategy NE Summary. Syllabus

Answers to Problem Set 4

In the Name of God. Sharif University of Technology. Graduate School of Management and Economics

Outline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010

that internalizes the constraint by solving to remove the y variable. 1. Using the substitution method, determine the utility function U( x)

Switching Costs, Relationship Marketing and Dynamic Price Competition

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

PAULI MURTO, ANDREY ZHUKOV

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

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

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

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

University of Hong Kong

Introduction to Game Theory

CUR 412: Game Theory and its Applications, Lecture 4

Iterated Dominance and Nash Equilibrium

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

Transcription:

Test 1 ECON3161, Game Theory Tuesday, September 2 th Directions: Answer each question completely. If you cannot determine the answer, explaining how you would arrive at the answer may earn you some points. 1. (30 points) Consider a simultaneous game between two rms where each can choose one of three di erent quantity levels: 30, 0, and 70. Their payo s are in the following matrix: q 2 = 30 q 2 = 0 q 2 = 70 q 1 = 30 1800; 1800 100; 2000 900; 1800 Firm 1 q 1 = 0 2000; 100 1600; 1600 800; 1200 q 1 = 70 1800; 900 1200; 800 0; 0 a ( points) De ne the term strictly dominant strategy. strategy? If so which rm and which strategy? Does either rm have a strictly dominant A strictly dominant strategy is a strategy that always provides a strictly greater payo than any other strategy the player could choose given the strategy the other player is choosing. In this game, 2000 is both Firm 1 s and s highest payo, so if any strategy is going to be strictly dominant for Firm 1 it has to be q 1 = 0 and for it would have to be q 2 = 0. We can see that neither strategy is strictly dominant because while q 1 = 0 and q 2 = 0 is best when the other rm chooses either 30 or 0, when the other rm chooses q i = 70 then choosing q j = 30 is best. b ( points) Looking at the entire 3x3 game (and just the entire game), does either rm have any strictly dominated strategies? If so, which rm and which strategy (or strategies) are strictly dominated and which strategy (or strategies) are they strictly dominated by? Yes, both rms have a strictly dominated strategy. For Firm 1, q 1 = 70 is strictly dominated by q 1 = 0 (2000>1800, 1600>1200, 800>0). For, q 2 = 70 is strictly dominated by q 2 = 0 (2000>1800, 1600>1200, 800>0) c (10 points) Use the iterated elimination of dominated strategies (IEDS) to reduce the matrix as far as possible. Explain the steps you use to reduce this matrix. From part b we know that we can eliminate q 1 = 70 because it is strictly dominated by q 1 = 0 as well as q 2 = 70 because it is strictly dominated by q 2 = 0. This leaves a 2x2 matrix: q 2 = 30 q 2 = 0 q 1 = 30 1800; 1800 100; 2000 Firm 1 q 1 = 0 2000; 100 1600; 1600 With this 2x2 matrix we can see that now q 1 = 30 is strictly dominated by q 1 = 0 and also q 2 = 30 is strictly dominated by q 2 = 0. Thus we can remove q 1 = 30 and q 2 = 30 to yield a 1x1 "matrix": 1

q 2 = 0 Firm 1 q 1 = 0 1600; 1600 This is the furthest the matrix can be reduced. d ( points) Find all pure strategy Nash equilibria (PSNE) to this game. Since the matrix can be reduced to a single outcome cell there is only one PSNE to this game: Firm 1 choose q 1 = 0 and choose q 2 = 0. e ( points) Will there be a mixed strategy Nash equilibrium to this game? If so nd it; if not, explain why not. There is no MSNE in this game. By using IEDS we can reduce the matrix to a single outcome cell so if we attempt to nd an MSNE to the game (either the 3x3 or 2x2 after q 1 = 70 and q 2 = 70 have been eliminated) we will be attempting to make players indi erent over strategies that are strictly dominated, which cannot happen. 2. (2 points) Consider the following game: P2 Y Z P1 W 2; 2 3 ; 3 X ; 1; 2 a (10 points) Find all pure strategy Nash equilibria (PSNE) to this game. The PSNE can be determined by using the method of best responses as in the game above. There are two PSNE: (1) P1 choose X, P2 choose Y and (2) P1 choose W and P2 choose Z. b (10 points) Find the mixed strategy Nash equilibrium (MSNE) to this game. The MSNE can be found be setting the expected value of each player s pure strategies equal to each other and then nding the probabilities of the other player that cause the expected value to be equal. For Pl s probabilities, letting w be the probability he chooses strategy W, we need: E 2 [Y ] = E 2 [Z] 2w + (1 w) = 3w + 2 (1 w) 3 3w = w 3 = w 3 = w So P1 would choose W with probability 3 and X with probability 1. of choosing strategy Y or Z when P1 uses these probabilities is 11. For P2 s probabilities, letting y be the probability he chooses strategy Y, we need: E 1 [W ] = E 1 [X] 2y + 3 (1 y) = y + 1 (1 y) 2 2y = 3y 2 = y 2 = y 2 Note that P2 s expected value

So P2 would choose Y with probability 2 and Z with probability 3. choosing strategy W or X when P2 uses these probabilities is 13. Note that P1 s expected value of So the MSNE is P1 choose W with probability 3 and X with probability 1 and P2 choose Y with probability 2 and Z with probability 3. c ( points) Can any of the equilibria (either pure or mixed) be eliminated using either the equilibrium payo dominance criterion or the undominated Nash equilibrium criterion? If so, which ones and by which criteria? None of the equilibria involve using a weakly dominated strategy so no equilibria can be removed by the undominated Nash equilibrium criterion. The table below lists the payo s for each player to each equilibrium: Eq. P1 payo P2 payo X; Y W; Z 3 3 MSNE 13 11 Since both players are strictly better o under the PSNE of X, Y, we can eliminate the other PSNE (W, Z) and the MSNE by equilibrium payo dominance. 3. (2 points) Consider a simultaneous game between two rms where each can choose one of three di erent price levels: $10, $0, and $70. Their payo s are in the following matrix: p 2 = $10 p 2 = $0 p 2 = $70 p 1 = $10 0 ; 0 0; 0 0; 0 Firm 1 p 1 = $0 0 ; 0 1600 ; 1600 3200 ; 0 p 1 = $70 0 ; 0 0; 3200 1800; 1800 a (10 points) Does any rm have any weakly dominated strategies? If so, which rm and which strategy (or strategies) are weakly dominated and which strategy (or strategies) are they weakly dominated by? Both rms have weakly dominated strategies in this game. For Firm 1, p 1 = $10 is weakly dominated by both p 1 = $0 and p 1 = $70. Also, p 1 = $70 is weakly dominated by p 1 = $0. The same is true for : p 2 = $10 is weakly dominated by both p 2 = $0 and p 2 = $70, and p 2 = $70 is weakly dominated by p 2 = $0. b (10 points) Find all pure strategy Nash equilibria (PSNE) to this game. The PSNE can be found by using the method of nding the best responses, as shown in the matrix above. There are two PSNE: (1) Firm 1 choosing p 1 = $10 and choosing p 2 = $10 and (2) Firm 1 choosing p 1 = $0 and choosing p 2 = $0. c ( points) Considering only the PSNE, can any equilibrium be eliminated using either the undominated Nash equilibrium or equilibrium payo dominance criteria? If so, which equilibrium and by which criterion? Explain why. The PSNE where both rms choose a price of $10 can be eliminated by either of the criteria. Note that choosing $10 is weakly dominated by choosing $0, so by undominated Nash equilibrium rms should choose the equilibrium where both choose a price of $0. Also, both rms receive a strictly higher payo in the PSNE when both choose $0, so by equilibrium payo dominance we can eliminate the equilibrium where both choose $10. 3

. (20 points) Consider the following 3 person game: Player 2 Player 2 A B A B Player 1 A 2 ; 1 ; 2 0; 1 ; 0 Player 1 A 0; 0; 1 0; 1 ; 1 B 1; 0; 0 1 ; 1 ; 0 B 1 ; 0; 1 1 ; 1 ; 1 - A B % Player 3 a ( points) Does any player have a strictly or weakly dominant strategy? which strategy? If so which player and The best responses are marked in the matrix above. Note that every payo for strategy B for Player 2 (in both matrices) is marked. Strategy B for Player 2 does strictly better than strategy A for Player 2 when: (1) Player 1 chooses B and Player 3 chooses A, (2) Player 1 chooses A and Player 3 chooses B, and (3) both Players 1 and 3 choose B. When both Players 1 and 3 choose A then strategy A and B (for Player 2) give the same payo of 1. So B is a weakly dominant strategy for Player 2. There are no other weakly dominant strategies. b (10 points) Find all pure strategy Nash equilibria (PSNE) to this game. There are two PSNE to this game: (1) All 3 players choose B and (2) all 3 players choose A. c ( points) Considering only the PSNE, can any equilibrium be eliminated using either the undominated Nash equilibrium or equilibrium payo dominance criteria? If so, which equilibrium and by which criterion? Explain why. The equilibrium when all 3 players choose B can be eliminated by equilibrium payo dominance because Players 1 and 3 are strictly better o when all choose A and Player 2 is no worse o when all choose A than when all choose B. Also note that the equilibrium when all 3 players choose A can be eliminated by undominated Nash equilibrium because Player 2 is using a weakly dominated strategy in this equilibrium. Bonus: ( points) Consider the game in question 3. Will there be any mixed strategy Nash equilibria in this game? Explain why or why not and nd the MSNE if you believe one exists. I m going to repost the matrix so it is here: p 2 = $10 p 2 = $0 p 2 = $70 p 1 = $10 0 ; 0 0; 0 0; 0 Firm 1 p 1 = $0 0 ; 0 1600 ; 1600 3200 ; 0 p 1 = $70 0 ; 0 0; 3200 1800; 1800 This is an odd game where there is a weakly dominant strategy for both rms where they each choose $0 and there are no strictly dominated strategies for any rm. Suppose we try to nd an MSNE over all 3 outcomes. Let a be the probability that Firm 1 chooses $10, b be the probability it chooses $0, and c be the probability it chooses $70. What I am going to do (you ll see why shortly) is set this up letting a = 1 b c. If I use the following two equations: and

I get: 0 (1 b c) + 0 b + 0 c = 0 (1 b c) + 1600 b + 3200 c 0 = 1600b + 3200c 3200c = 1600b 2c = b (I used a = 1 b c because I knew a would be multiplied by 0). Now there s a problem already, that 2c = b and the only way this can happen is if b = c = 0. Let s look at the second equation: 0 (1 b c) + 0 b + 0 c = 0 (1 b c) + 0 b + 1800 c 0 = 1800c 0 = c We have now con rmed that c = 0, which means that b = 0, which means that a = 1. But this leads us right back to our PSNE where both players choose $10. What if we wanted to try to make a mixture over only two strategies (say $10 and $0, or $10 and $70, or $0 and $70). If we try to mix over only $0 or $70 (and leave out the $10 strategy) then playing $70 is strictly dominated by $0 and we can t make a mixture that adheres to the laws of probability. If we try to mix over $10 and $0 (which makes the most sense since this involves the two strategies that determine the PSNE), then we get: 0 = 0 (1 b) + 1600 b 0 = b So we are right back to where we started with both rms choose a price of $10. If we try to mix over $10 and $70 (which may make the least sense since we are omitting the weakly dominant strategy), we still end up back at the PSNE where both players choose $10. 0 = 0 (1 c) + 1600 c 0 = c Now we have exhausted all the possibilities and we still cannot nd an MSNE that is not a PSNE. This is because there is a PSNE involving both rms using weakly dominated strategies. In class I mentioned that there are typically an odd number of equilibria in games - however, this is one of the special cases where we actually have an even number of equilibria as there are no MSNE which are not PSNE.