 A similar “dynamic consistency” argument can be used to defend EU preferences in addition to learning in accordance with conditionalisation (see Hammond 1976, 1977, 1988b,c). It is assumed, as before, that the agent takes a sophisticated approach to sequential decision problems. Hammond shows that only a fully Bayesian agent can plan to pursue any path in a sequential decision tree that is deemed optimal at the initial choice node. This makes the Bayesian agent unique in that she will never make “self-defeating choices” on account of her preferences and norms for preference change. She will never choose a strategy that is worse by her own lights than another strategy that she might otherwise have chosen, if only her preferences were such that she would choose differently at one or more future decision nodes.