- Problem 4 Strategies And Subgames 4 Pts Consider The Following Game Tree 1a 2a 2b 2c M E G H 1b 1c 1d The Payoffs 1 (46.07 KiB) Viewed 34 times
Problem #4: Strategies and Subgames (4 pts) Consider the following game tree: 1A 2A 2B 2C m-> E G H 1B 1C 1D The payoffs in this game tree have been left blank, because they will not matter in this question. Additionally, the decision nodes have been marked so that they can be referred to easily: 1A, 1B, 1C, and ID are all decision nodes belonging to Player 1, while 2A, 2B, and 2C all belong to Player 2. a) How many strategies does each player have? (Remember that a strategy in an extensive- form game consists of one action to be taken at each of the player's nodes.) b) List at least 4 strategies belonging to each player. c) How many proper subgames does this game have? List all of the decision nodes that are the beginning of a proper subgame.