I don't see this. For example, the mixed strategy of one-boxing half the time and two-boxing half the time generates very different results in the transformed problem than in the original Newcomb's Problem.
Conventionally, you are not allowed access to a random number generator in Newcomb's Problem - and so can't use a mixed strategy. Any such usage would tarnish Omega's reputation. Omega - being a mind-reading superintelligence - can fairly easily discourage such a tactic by punishing randomising agents economically - and letting the punishment strategy be known.
This is equivalent to Newcomb's Problem in the sense that any strategy does equally well on both, where by "strategy" I mean a mapping from info to (probability distributions over) actions.
I suspect that any problem with Omega can be transformed into an equivalent problem with amnesia instead of Omega.
Does CDT return the winning answer in such transformed problems?
Discuss.