问题：
[填空题]On finite extensive games, the Backward Induction strategy is the largest subrelation g of the total move relation that has at least one successor at each node, while satisfying the following property for all players i: No alternative move for the current player i yields outcomes via further play with o that are all strictly better for ithan all outcomes resulting from starting at the current move and then playing o all the way down the tree.
