Without invoking complexity, one can say that an agent is immune to this form of Pascal's mugging if, for fixed I, the quantity P(x amount of utility | I) goes to zero as x grows.

If the agent's utility function is such that "x amount of utility" entails "f(x) amount of complexity," f(x) --> infinity, then this will hold for priors that are sensitive to complexity.