TDT might or might not be well-defined in the case where the driver literally always predicts correctly, but if the driver is incorrect with probability 10−100 , then you don’t find yourself in the situation of not being able to pay by not paying up, if you are conditioning on your observations (the same way you have to in counterfactual mugging in order to not pay up). It reduces the a priori probability of your observations but this doesn’t matter if you update on them. There might be a decision theory other than UDT that takes this into account but I don’t know of it.
The kind of agent who pays in Counterfactual Mugging ends up $1000000 richer half the time, and $100 poorer half the time. Unless you are updating on which branch you are in, which means you should also update on the driver having picked you up.
TDT might or might not be well-defined in the case where the driver literally always predicts correctly, but if the driver is incorrect with probability 10−100 , then you don’t find yourself in the situation of not being able to pay by not paying up, if you are conditioning on your observations (the same way you have to in counterfactual mugging in order to not pay up). It reduces the a priori probability of your observations but this doesn’t matter if you update on them. There might be a decision theory other than UDT that takes this into account but I don’t know of it.
The kind of agent who pays in Counterfactual Mugging ends up $1000000 richer half the time, and $100 poorer half the time. Unless you are updating on which branch you are in, which means you should also update on the driver having picked you up.
You’re right, Parfit’s Hitchhiker with non-perfect predictive power is equivalent to Counterfactual Mugging.