Consider the following two-player extensive-form game with perfect information. Player 1 moves first, choosing between actions...

 

Transcribed Image Text:

Consider the following two-player extensive-form game with perfect information. Player 1 moves first, choosing between actions A and B. Player 2 moves second, choosing between actions C and D if player 1 played A, and choosing between actions E and F if player 1 played B. Player 1 makes a final move: a choice between actions G and H following the history of play (A, C); a choice between I and J after history (A, D); a choice between K and L after history (B, E); a choice between M and N after history (B, F). The payoffs for each path of play are given in the following table: Path (A, C, G) (A, C, H) (A, D, I) (A, D, J) (B, E, (B, E, L) (B, F, M) (B, F, N) Payoffs (3,4) (4,3) (1,2) (5,7) (2,8) (9,1) (3,6) (a) [2 points] Draw the extensive-form representation of this game. (b) [2 points] How many subgames does the game have? How many pure strategies does each player have? (c) [4 points] Solve the game using backward induction. (d) [2 points] Does the game have a Nash equilibrium in which players get payoffs (5, 7)? If yes, construct such an equilibrium. If not, explain why not. For parts (c) and (d), make sure to specify the equilibrium strategies at every decision node. Consider the following two-player extensive-form game with perfect information. Player 1 moves first, choosing between actions A and B. Player 2 moves second, choosing between actions C and D if player 1 played A, and choosing between actions E and F if player 1 played B. Player 1 makes a final move: a choice between actions G and H following the history of play (A, C); a choice between I and J after history (A, D); a choice between K and L after history (B, E); a choice between M and N after history (B, F). The payoffs for each path of play are given in the following table: Path (A, C, G) (A, C, H) (A, D, I) (A, D, J) (B, E, (B, E, L) (B, F, M) (B, F, N) Payoffs (3,4) (4,3) (1,2) (5,7) (2,8) (9,1) (3,6) (a) [2 points] Draw the extensive-form representation of this game. (b) [2 points] How many subgames does the game have? How many pure strategies does each player have? (c) [4 points] Solve the game using backward induction. (d) [2 points] Does the game have a Nash equilibrium in which players get payoffs (5, 7)? If yes, construct such an equilibrium. If not, explain why not. For parts (c) and (d), make sure to specify the equilibrium strategies at every decision node.

Answer rating: 100% (QA)

a See FIG 1 below for extensiveform representation of given game b There are 6 subgames and player 1 has 8 pure strategies while player 2 has 4 pure s... View the full answer