This paper explores the consequences of applying two natural ideas from epistemology to decision theory: (1) that knowledge should guide our actions, and (2) that we know a lot of non-trivial things. In particular, we explore the consequences of these ideas as they are applied to standard decision theoretic puzzles such as the St. Petersburg Paradox. In doing so, we develop a “knowledge-first” decision theory and we will see how it can help us avoid fanaticism with regard to the St. (...) Petersburg puzzle and related puzzles. The result will be a decision theory that gives a novel, but well-motivated, reason for discounting small probabilities when making decisions. We examine the merits and demerits of such a decision theory. (shrink)

People with the kind of preferences that give rise to the St. Petersburg paradox are problematic---but not because there is anything wrong with infinite utilities. Rather, such people cannot assign the St. Petersburg gamble any value that any kind of outcome could possibly have. Their preferences also violate an infinitary generalization of Savage's Sure Thing Principle, which we call the *Countable Sure Thing Principle*, as well as an infinitary generalization of von Neumann and Morgenstern's Independence axiom, which we call *Countable (...) Independence*. In violating these principles, they display foibles like those of people who deviate from standard expected utility theory in more mundane cases: they choose dominated strategies, pay to avoid information, and reject expert advice. We precisely characterize the preference relations that satisfy Countable Independence in several equivalent ways: a structural constraint on preferences, a representation theorem, and the principle we began with, that every prospect has a value that some outcome could have. (shrink)

Although expected utility theory has proven a fruitful and elegant theory in the finite realm, attempts to generalize it to infinite values have resulted in many paradoxes. In this paper, we argue that the use of John Conway's surreal numbers shall provide a firm mathematical foundation for transfinite decision theory. To that end, we prove a surreal representation theorem and show that our surreal decision theory respects dominance reasoning even in the case of infinite values. We then bring our theory (...) to bear on one of the more venerable decision problems in the literature: Pascal's Wager. Analyzing the wager showcases our theory's virtues and advantages. To that end, we analyze two objections against the wager: Mixed Strategies and Many Gods. After formulating the two objections in the framework of surreal utilities and probabilities, our theory correctly predicts that (1) the pure Pascalian strategy beats all mixed strategies, and (2) what one should do in a Pascalian decision problem depends on what one's credence function is like. Our analysis therefore suggests that although Pascal's Wager is mathematically coherent, it does not deliver what it purports to, a rationally compelling argument that people should lead a religious life regardless of how confident they are in theism and its alternatives. (shrink)

:We address the question, in decision theory, of how the value of risky options should be assessed when they have no finite standard expected value, that is, where the sum of the probability-weighted payoffs is infinite or not well defined. We endorse, combine and extend the proposal of Easwaran to evaluate options on the basis of their weak expected value, and the proposal of Colyvan to rank options on the basis of their relative expected value.

This paper presents a new solution to the problems for orthodox decision theory posed by the Pasadena game and its relatives. I argue that a key question raised by consideration of these gambles is whether evaluative compositionality (as I term it) is a requirement of rationality: is the value that an ideally rational agent places on a gamble determined by the values that she places on its possible outcomes, together with their mode of composition into the gamble (i.e. the probabilities (...) assigned to them)? The paper first outlines a certain simple response to the Pasadena game and identifies two problems with this response, the second of which is that it leads to a wholesale violation of evaluative compositionality. I then argue that rationality does not require decision makers to factor in outcomes of arbitrarily low probability. A method for making decisions which flows from this basic idea is then developed, and it is shown that this decision method (Truncation) leads to a limited — as opposed to wholesale — violation of evaluative compositionality. The paper then argues that the truncation method yields solutions to the problems posed by the Pasadena game and its relatives that are both attractive in themselves and superior to those yielded by alternative proposals in the literature. (shrink)

We argue that indeterminate probabilities are not only rationally permissible for a Bayesian agent, but they may even be rationally required . Our first argument begins by assuming a version of interpretivism: your mental state is the set of probability and utility functions that rationalize your behavioral dispositions as well as possible. This set may consist of multiple probability functions. Then according to interpretivism, this makes it the case that your credal state is indeterminate. Our second argument begins with our (...) describing a world that plausibly has indeterminate chances. Rationality requires a certain alignment of your credences with corresponding hypotheses about the chances. Thus, if you hypothesize the chances to be indeterminate, your will inherit their indeterminacy in your corresponding credences. Our third argument is motivated by a dilemma. Epistemic rationality requires you to stay open-minded about contingent matters about which your evidence has not definitively legislated. Practical rationality requires you to be able to act decisively at least sometimes. These requirements can conflict with each other-for thanks to your open-mindedness, some of your options may have undefined expected utility, and if you are choosing among them, decision theory has no advice to give you. Such an option is playing Nover and Hájek’s Pasadena Game , and indeed any option for which there is a positive probability of playing the Pasadena Game. You can serve both masters, epistemic rationality and practical rationality, with an indeterminate credence to the prospect of playing the Pasadena game. You serve epistemic rationality by making your upper probability positive-it ensures that you are open-minded. You serve practical rationality by making your lower probability 0-it provides guidance to your decision-making. No sharp credence could do both. (shrink)

We prove a representation theorem for preference relations over countably infinite lotteries that satisfy a generalized form of the Independence axiom, without assuming Continuity. The representing space consists of lexicographically ordered transfinite sequences of bounded real numbers. This result is generalized to preference orders on abstract superconvex spaces.

The rational price of the Pasadena and Altadena games, introduced by Nover and Hájek (2004 ), has been the subject of considerable discussion. Easwaran (2008 ) has suggested that weak expectations — the value to which the average payoffs converge in probability — can give the rational price of such games. We argue against the normative force of weak expectations in the standard framework. Furthermore, we propose to replace this framework by a bounded utility perspective: this shift renders the problem (...) more realistic and accounts for the role of weak expectations. In particular, we demonstrate that in a bounded utility framework, all agents, even if they have different value functions and disagree on the price of an individual game, will finally agree on the rational price of a repeated, averaged game. Thus, we explain the intuitive appeal of weak expectations, while avoiding both trivialization of the original paradox and the drawbacks of previous approaches. (shrink)

The existence of a transitive, complete, and weakly independent relation on the full set of gambles implies the existence of a non-Ramsey set. Therefore, each transitive and weakly independent relation on the set of gambles either is incomplete or does not have an explicit description. Whatever tools decision theory makes available, there will always be decision problems where these tools fail us. In this sense, decision theory remains incomplete.

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)

In some games, the products of the probabilities times the payouts result in a series that is conditionally convergent, which means that the sum can vary based on the order in which the products are summed. The purpose of this paper is to address the question: How should such games be valued? We first show that, contrary to widespread belief, summing in the order determined by the mechanism of the game does not lead to the correct value. We then consider (...) other attempts to value such games. We suggest that games with conditionally convergent series are properly valued by summing the products in increasing order of the absolute values of the game’s payouts. (shrink)