Let X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{X }$$\end{document} be a set of outcomes, and let I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{I }$$\end{document} be an infinite indexing set. This paper shows that any separable, permutation-invariant preference order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} on XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{X }^\mathcal{I }$$\end{document} admits an additive representation. That is: there exists a linearly ordered abelian group R\documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{R }$$\end{document} and a ‘utility function’ u:X⟶R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u:\mathcal{X }{{\longrightarrow }}\mathcal{R }$$\end{document} such that, for any x,y∈XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x},\mathbf{y}\in \mathcal{X }^\mathcal{I }$$\end{document} which differ in only finitely many coordinates, we have x≽y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x}\succcurlyeq \mathbf{y}$$\end{document} if and only if ∑i∈Iu-u≥0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{i\in \mathcal{I }} \left[u-u\right]\ge 0$$\end{document}. Importantly, and unlike almost all previous work on additive representations, this result does not require any Archimedean or continuity condition. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} also satisfies a weak continuity condition, then the paper shows that, for anyx,y∈XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x},\mathbf{y}\in \mathcal{X }^\mathcal{I }$$\end{document}, we have x≽y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x}\succcurlyeq \mathbf{y}$$\end{document} if and only if ∗∑i∈Iu≥∗∑i∈Iu\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\sum _{i\in \mathcal{I }} u\ge {}^*\!\sum _{i\in \mathcal{I }}u$$\end{document}. Here, ∗∑i∈Iu\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\sum _{i\in \mathcal{I }} u$$\end{document} represents a nonstandard sum, taking values in a linearly ordered abelian group ∗R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\mathcal{R }$$\end{document}, which is an ultrapower extension of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{R }$$\end{document}. The paper also discusses several applications of these results, including infinite-horizon intertemporal choice, choice under uncertainty, variable-population social choice and games with infinite strategy spaces. (shrink)

Standard decision theory has trouble handling cases involving acts without finite expected values. This paper has two aims. First, building on earlier work by Colyvan (2008), Easwaran (2014), and Lauwers and Vallentyne (2016), it develops a proposal for dealing with such cases, Difference Minimizing Theory. Difference Minimizing Theory provides satisfactory verdicts in a broader range of cases than its predecessors. And it vindicates two highly plausible principles of standard decision theory, Stochastic Equivalence and Stochastic Dominance. The second aim is to (...) assess some recent arguments against Stochastic Equivalence and Stochastic Dominance. If successful, these arguments refute Difference Minimizing Theory. This paper contends that these arguments are not successful. (shrink)

Dozens of articles have addressed the challenge that gambles having undefined expectation pose for decision theory. This paper makes two contributions. The first is incremental: we evolve Colyvan's ``Relative Expected Utility Theory'' into a more viable ``conservative extension of expected utility theory" by formulating and defending emendations to a version of this theory proposed by Colyvan and H\'ajek. The second is comparatively more surprising. We show that, so long as one assigns positive probability to the theory that there is a (...) uniform bound on the utility of possible gambles (and assuming a uniform bound on the amount of utility that can accrue in a fixed amount of time), standard principles of anthropic reasoning (as formulated by Brandon Carter) place lower and upper bounds on the expected values of gambles advertised as having no expectation--even assuming that with positive probability, all gambles advertised as having infinite expected utility are administered faithfully. Should one accept the uniform bound premises, this reasoning thus dissolves (or nearly dissolves, in some cases) several puzzles in infinite decision theory. (shrink)

Many philosophers think that punishment is intentionally harmful and that this makes it especially hard to morally justify. Explanations for the latter intuition often say questionable things about the moral significance of the intent to harm. I argue that there’s a better way to explain this intuition.

The principle of Anteriority says that prospects that are identical from the perspective of every possible person’s welfare are equally good overall. The principle enjoys prima facie plausibility, and has been employed for various theoretical purposes. Here it is shown using an analogue of the St Petersburg Paradox that Anteriority is inconsistent with central principles of axiology.

This paper is a response to Paul Bartha’s ‘Making Do Without Expectations’. We provide an assessment of the strengths and limitations of two notable extensions of standard decision theory: relative expectation theory and Paul Bartha’s relative utility theory. These extensions are designed to provide intuitive answers to some well-known problems in decision theory involving gaps in expectations. We argue that both RET and RUT go some way towards providing solutions to the problems in question but neither extension solves all the (...) relevant problems. (shrink)