Derive backward induction strategies for the games shown in Fig. 7.37 (p. 372). (a) Which games admit multiple backward induction strategies? (b) Prove that if a finite perfect information game has the property that no player is indifferent between any pair of end nodes, then the backward induction strategies are unique.

CHAPTER 7 ON N (o) N - (9) (8) (2) ( 3 ) (a) (b) 2 ON (1) (8) (8) (2 ) (c) Figure 7.37