I don't understand how this helps. It doesn't seem to allow anything I couldn't do before. Is it just that you find it easier to justify to yourself substituting the decision of the enemy for your own than the decision you would precommit to for your current one?
It doesn't seem to allow anything I couldn't do before.
Yes, basically. This is "secretly" just a different way of looking at UDT, and this particular way is easy to get to from a standard game-theoretic starting point, but harder to get to from a "rationality is what wins" starting point.
Given that the non-anthropic problem is interesting because it introduces tension between these two viewpoints (sorta), this trick is interesting because it reduces that tension.
Manfred could answer better, but I think this trick is designed to help with point of view.
The problem with anthropic problems is that you aren't sure which you is you. There's all sorts of branches that occur, and you don't know which branch you're on. You're trying your damnedest to look backwards up the branching probability tree and hoping you don't lose track of any branches.
By pretending you're the researcher, you're looking at possible branching futures the other way. You always have a frame of reference that doesn't change subjectively, and doesn't need updates. At least, that's how I think it's supposed to work.
The helpfulness described here is this: The mathematics are simpler. [Xachariah's response explains why.]
Explanations for decision trees can also be simpler. Newcomblike problems become almost trivial to consider from Omega's perspective, for example, even in the counterfactual mugging case.
The mathematics are simpler.
I can do all the same mathematics without creating an imaginary enemy. The only thing that is changing here is how I choose to describe the mathematics in question to myself. This evidently allows Manfred to feel comfortable doing specific mathematics that he would not be comfortable doing without describing it in terms of a contrived enemy's perspective.
So their expected value of "yea" is -550, while their expected value of "nay" is -700.
This is only true if the experimenter doesn't know the result of a coin flip (otherwise it's either 1000/700 or 100/700, but you don't know which). But how do you decide to model your opponent as being someone who doesn't know the result, rather than someone who does? The only way I can think of is to follow UDT and always specify that your opponent is in a state of complete ignorance. But once we've borrowed this rule from UDT it seems like we're just plain using all of UDT. We've just made it more complicated by sticking a minus sign on the utilities and then picking the least favoured one. The use of an "opponent" doesn't seem to add any insight.
Suppose I rephrase UDT this way: Visualise a version of yourself before you had any evidence. Do what they would want you to do. As far as I can tell, this is just the above post with the minus signs taken out.
we're just plain using all of UDT
Yep. The exposition is merely different, and a few more of the assumptions hidden behind common sense :P
If this exposition doesn't "work" for you, then that's fine too.
That's a nice trick, but it seems to me that a confused person could still manage to stay confused. They could say that being a decider provides information about the coinflip, which can be used to make the opponent suffer more...
A while ago, we were presented with an interesting puzzle, usually just called "Psy-kosh's non-anthropic problem." This problem is not, as is made clear, an anthropic problem, but it generates a similar sort of confusion by having you cooperate with people who think like you, and you're unsure which of these people you are.
In the linked post, cousin_it declares "no points for UDT," which is why this post is not called a total solution, but a cute trick :) What I call zero-sum conversion is just a way to make the UDT calculations (that is, the things you do when calculating what the actual best choice is) seem obvious - which is good, since they're the ones that give you the right answer. This trick also makes the UDT math obvious on the absent-minded driver problem and the Sleeping Beauty problem (though that's trickier).
The basic idea is to pretend that your decision is part of a zero-sum game against a non-anthropic, non-cooperating, generally non-confusing opponent. In order to do this, you must construct an imaginary opponent such that for every choice you could make, their expected utility for that choice is the negative, the opposite of your expected utility. Then you simply do the thing your opponent likes least, and it is equivalent to doing the thing you'll like best.
Example in the case of the non-anthropic problem (yes, you should probably have that open in another tab):
Your opponent here is the experimenter, who really dislikes giving money to charity (characterization isn't necessary, but it's fun). For every utilon that you, personally, would get from money going to charity when you say "yea" or "nay," the experimenter gets a negative utilon.
Proof that the experimenter's expected utilities are negative yours is trivial in this case, since the utilities are opposites for every possible outcome, including cases where you're not a decider. But things can be trickier in other problems, since expected utilities can be opposites without the utilities being exactly opposite for all outcomes. For example, what happens in the case where the participants in the non-anthropic problem get individual candybars instead of collective money to charity?
Anyhow, now that we have our opponent whose expected utilities are the opposite of yours for every decision you make, you just have to make the decision that's worst for your opponent. This is pretty easy, since our opponent doesn't have to deal with any confusing stuff - they just flip a coin, which to them is an ordinary 50/50 situation, and then pay out based on your decision. So their expected value of "yea" is -550, while their expected value of "nay" is -700.
This valuation already takes into account cooperation and all that stuff - it's simply correct. It's merely a coincidence that this seems like you didn't update the evidence of whether you're a decider or not. Though, now that you mention it, it's a general fact that in cooperate problems like this, you can construct a suitable opponent by just reversing your utility in all situations, giving you this "updatelessness."
Disclaimer: I haven't looked very hard for people writing up this trick before me. Katja or someone quite possibly already has this on their blog somewhere.