Question

1. The following is the extensive-form representation (omitting payoffs) of a game: ·N = {1, 2, 3): . H = 10, A, B, C. Ay, An, Ayy, Ayr, Any, Ann. Ba, Bb. Bc,CY.CN,CYY, CYN,CNY, CNN): ·Z = {Ayy, Ayn, Any, Ann, Ba, Bb. Bc, CYy, CYN,CNY, CNN): (1) Draw the corresponding game tree of the game; (8 points) (2) Write down the sets of strategies for each player; (7 points) (3) Suppose the information sets in this game are: (0), (A), (B), (C), {Ay, An and CY, CN. Revise the game tree accordingly and write down the sets of strategies for each player. (10 points)

Answer 1