The result also applies if Mallory has limited opportunities to change Bob’s information, e.g. a 10% chance of successfully changing it. Or you could have any other complicated setup. In such cases Bob’s best strategy involves some updating, and the result says that such updating cannot lower Bob’s score on average. (If you’re wondering why Bob’s strategy in a Nash equilibrium must look like Bayesian updating at all, the reason is given by the definition of a proper scoring rule.) In other words, it’s still trivial, but not quite as trivial as you say. Also note that if Mallory’s options are limited, her best strategy might become pretty complicated.
The result also applies if Mallory has limited opportunities to change Bob’s information, e.g. a 10% chance of successfully changing it. Or you could have any other complicated setup. In such cases Bob’s best strategy involves some updating, and the result says that such updating cannot lower Bob’s score on average. (If you’re wondering why Bob’s strategy in a Nash equilibrium must look like Bayesian updating at all, the reason is given by the definition of a proper scoring rule.) In other words, it’s still trivial, but not quite as trivial as you say. Also note that if Mallory’s options are limited, her best strategy might become pretty complicated.