Short Answer Part 2 Consider the following sequential-move game: Player 1 Player 2 Player 3 Player 2 L Player 3 R L R Player 1 Player 3 R 2 3 5 4 5 4 L R L Player 3 R Find the backward-induction equilibrium of this game. L 5 5 2. 5 5 2 Player 2 R Player 3 R 5

Use the following game table to answer the question: Player 2 Y 6, 3 1, 3 A 10, 5 0,0 Player 1 B 2,6 0,0 3,5 3, 4 3, 3 Is the Nash equilibrium of this game for Player 1 to choose A and Player 2 to choose X? Why or why not? O It is; if Player 2 chose B or C they would get less than 10, and if Player 1 chose Y or Z they would get less than 5. It is not; Player 2 could get 6, instead of 5, if they chose B. O It is; if Player 1 chose B or C they would get less than 10, and if Player 2 chose Y or Z they would get less than 5. It is; if Player 2 chose B or C they would get less than 5, and if Player 1 chose Y or Z they would get less than 10. It is not; Player 1 could get 6, instead of 5, if they chose B.

Explain the nature of game theory. What current issue could this be applied to?

3. Consider the following game in normal form. Player 1 is the "row" player with strate- gies a, b, c, d and Player 2 is the "column" player with strategies w, x, y, z. The game is presented in the following matrix: W x y Z 2,1 0,2 2,1 a 3,3 b 1,1 1,2 1,0 1,4 c 0,0 1,0 3,2 1,1 d 0,0 0,5 0,2 3,1 Find all the Nash equilibria in the game in pure strategies.

Question 5 Consider following extensive form game Keep Prices (8,2) Advertise Lower Prices (4,6) O Advertise; Lower Prices Firm 1 O Advertise; Keep Prices Firm 2 O Not Advertise; Keep Prices Not Advertise The subgame perfect Nash-equilibrium is O Not Advertise; Lower Prices Keep Prices (6,10) O Lower Prices (3,7) 5 pts

3. Consider the following game: K Out 2 2 1 9 Player 1 Player 1 X In A Y Player 2 0 2 B 5 5 a) Does the game have perfect information? Why/why not? b) Circle the subgames. c) Find all backward induction solutions. d) Below are written five strategy profiles. One of them is a subgame perfect equilibrium; circle it! One of them is not a Nash equilibrium; write "X" across it! ((Out, X), A) ((Out, Y), A) ((In, Y),B) ((Out, Y), B) ((In, X),B)

The hand written is not allowed.

5. Consider a game with the following payoff table for player 1: Strategy Player 1 1 11 2 3 1 3 -4 1 Player 2 2 -3 -2 3 3 -2 −1 2 (a) Use Excel Solver to find the optimal mixed strategy for each player.