Question

请问这道博弈论的题目有高手会做吗,感谢

Two players must choose among a pool of three candidates: fa; b; cg. Player 1 prefers
a to b and b to c. Player 2 prefers b to a and a to c. The rules are that player 1 moves
Örst and can veto one of the three candidates. Then player 2 can choose one of the
remaining two candidates.
(a) Draw the game tree that represents this game assuming that a playerís most
preferred candidate gives a payo§ of 2, second most preferred candidate gives
a payo§ of 1 and least preferred candidate gives a payo§ of 0.
(b) How many pure strategies does each player have?
(c) Find the SPNE. Is it unique?
(d) Are there NE that are not SPNE?

Answer 1

详细过程如图请参考（可能有点简略）