This paper develops an argument against causal decision theory. I formulate a principle of preference, which I call the Guaranteed Principle. I argue that the preferences of rational agents satisfy the Guaranteed Principle, that the preferences of agents who embody causal decision theory do not, and hence that causal decision theory is false.

Consequentialists often assume rational monism: the thesis that options are always made rationally permissible by the maximization of the selfsame quantity. This essay argues that consequentialists should reject rational monism and instead accept rational pluralism: the thesis that, on different occasions, options are made rationally permissible by the maximization of different quantities. The essay then develops a systematic form of rational pluralism which, unlike its rivals, is capable of handling both the Newcomb problems that challenge evidential decision theory and the (...) unstable problems that challenge causal decision theory. (shrink)

In Newcomb’s paradox you can choose to receive either the contents of a particular closed box, or the contents of both that closed box and another one. Before you choose though, an antagonist uses a prediction algorithm to accurately deduce your choice, and uses that deduction to fill the two boxes. The way they do this guarantees that you made the wrong choice. Newcomb’s paradox is that game theory’s expected utility and dominance principles appear to provide conflicting recommendations for what (...) you should choose. Here we show that the conflicting recommendations assume different probabilistic structures relating your choice and the algorithm’s prediction. This resolves the paradox: the reason there appears to be two conflicting recommendations is that the probabilistic structure relating the problem’s random variables is open to two, conflicting interpretations. We then show that the accuracy of the prediction algorithm in Newcomb’s paradox, the focus of much previous work, is irrelevant. We end by showing that Newcomb’s paradox is time-reversal invariant; both the paradox and its resolution are unchanged if the algorithm makes its ‘prediction’ after you make your choice rather than before. (shrink)

You should rather play hide-and-seek against someone who cannot predict where you hide than against someone who can, as the article illustrates in connection with a high-stakes example. Causal Decision Theory denies this. So Causal Decision Theory is false.

‘Ifs’ come washed or unwashed. The washed ifs are embedded in precise theories: the constantly strict implication of deductive inference, the variably strict implication of ‘nearness’ conditionals, and statements of conditional probability. By a nearness conditional I mean the common part of Stalnaker's and D. Lewis's theory of counterfactual conditionals, which depends on a notion that possible worlds are more or less near to each other, as a measure of their over-all similarity to each other.

This paper treats two problem cases in decision theory, the Newcomb problem and Reed Richter''s Button III. Although I argue that, contrary to Richter, the latter case does not constitute a genuine counterexample to a standard general proposition of (causal) decision theory, I agree with and undertake to amplify his solution to the decision problem in Button III. I then apply the conclusions and distinctions in the foregoing treatment of Button III to the Newcomb problem and argue that a familiar (...) version of the dominance argument for taking both boxes runs afoul of plausible general constraints on rational agency. The underlying theme of the paper is that basic considerations of epistemic coherence play an important role in dealing with problem cases in decision theory. (shrink)

‘Ifs’ come washed or unwashed. The washed ifs are embedded in precise theories: the constantly strict implication of deductive inference, the variably strict implication of ‘nearness’ conditionals, and statements of conditional probability. By a nearness conditional I mean the common part of Stalnaker's and D. Lewis's theory of counterfactual conditionals, which depends on a notion that possible worlds are more or less near to each other, as a measure of their over-all similarity to each other.