 As promised in the previous post, I develop my formalism for justifying as many of the decisiontheoretic axioms as possible with generalized dutchbook arguments. (I’ll use the term “generalized dutchbook” to refer to arguments with a family resemblance to dutchbook or moneypump.) The eventual goal is to relax these assumptions in a way which addresses bounded processing power, but for now the goal is to get as much of classical decision theory as possible justified by a generalized dutchbook.
I made some predictions about what I would and wouldn’t be able to justify with generalized dutchbook. These turned out to be only partially correct. I was able to get a version of Jeffrey’s evidential decision theory, but with nonstandard utility and probability functions and with less assumptions about the structure of the boolean algebra. Nonstandard probability and utility functions are not a very big generalization in themselves. This makes it a little less interesting, supporting Scott’s comment. I still have some hope that more interesting things can be developed from this going forward, though.
I wouldn’t be too surprised if this has all been done before and I just haven’t been able to find it. Justifying all of the axioms in terms of generalized dutchbook arguments seems like an obviously desirable thing to do. Yet, I haven’t seen such a complete justification of common axioms via generalized dutchbooks; that is part of why I initially assumed it would not be possible. The closest thing I’ve heard about is Stuart Armstrong’s post showing that immunity to a generalization of the moneypump argument is necessary and sufficient for the VNM axioms minus continuity. So, although the result here doesn’t give as much of a generalization of decision theory as I might have hoped for, it’s the nicest justification of evidential decision theory that I know of.
Agents
The basic representation of an agent’s preference is as follows:
 The agent has a set \(B\) of possible beliefs, which is a Boolean algebra. Elements of \(B\) will be called propositions.
 The agent has preferences over \(B\{\bot\}\), which can be revealed by asking it to choose from a nonempty set of propositions \(\emptyset \subset S \subseteq (B\{\bot\})\). (These need not be mutually exclusive; we can ask things like “Would you rather be a bank teller or a feminist bank teller?”) The choices of the agent are represented by a choice function \(Ch(S)\), such that \(\emptyset \subset Ch(S) \subseteq S\).
 \(Ch(\{X,Y\})=\{Y\}\) will be abbreviated \(X \preceq Y\). \(Ch(\{X,Y\})=\{X,Y\}\) will be abbreviated \(X \sim Y\). \(X \preceq Y\) means that either \(X \prec Y\) or \(X \sim Y\).
I’m representing preferences on sets only so that I can argue that this reduces to binary preference. Forcing the choice function to return at least one item is like assuming the completeness of binary preference. This deprives me of the chance to apply Vadim’s moneypump argument for completeness, but I think “the agent has to make a choice” is a decent justification for completeness. I allow the agent to return more than one choice because to do otherwise would be equivalent to assuming antisymmetry; this seems too strong. We want an agent to be able to be indifferent between propositions. (You can imagine that the agent would choose randomly when confronted with such choices, but the choice function encodes the set of choices they might make.)
Money and Contracts
In order to make the moneypump argument, I’ll need a concept of money. I assume that money comes from an ordered field \(M\). To make dutchbook arguments, I also need contracts which pay money conditional on certain propositions. These can be represented as a pair, \([P,m] \in B \times M\). The agent holds a multiset of contracts, since it’s meaningful to hold several copies of the same contract. In fact, for one proof I’ll need counts of contracts to come from \(M\), so that we can have fractionally many, negatively many, and whatever else \(M\) provides. (This is a somewhat unfortunate complication, but I didn’t find a way to do without it.) However, to avoid headaches, I consider only multisets with finitely many nonzero counts. So, putting these together, we will extend the preferences of the agent to triples giving a proposition, an amount of money, and a multiset of contracts: \((P,m,c) \in (B\bot) \times M \times (B \times M) \rightarrow M\). Such triples will be called prospects. I will still use the abbreviations \(\prec\), \(\sim\), and \(\preceq\). I’ll also write \(P+m\) to indicate the addition of money to a prospect. Multiset addition will be written \(\uplus\), so for example \(c' = c \uplus \{[A,1]\}\) means that \(c'\) is like \(c\) except that the count of contract \([A,1]\) is one greater.
Lemma 1 (constraints on value of money). We can extend \(Ch()\) on nonempty sets of propositions to a function \(Ch'()\) on nonempty sets of prospects, in a way which satisfies the following requirements:
 Like choices over propositions, choices over prospects return only elements from the given set, and return at least one such element: for a nonempty set of prospects \(C\), we have \(Ch'(C) \subseteq C\) and \(Ch'(C) \neq \emptyset\).
 For a set of propositions \(S\), let \(S^*\) be the set of prospects \((A,0,\emptyset)\) where \(A \in S\). Then we require \(Ch'(S^*) = (Ch(S))^*\). In other words, decisions are the same as before when no money or contracts are involved.
 All else being equal, more money is better: for real numbers \(n,m\), \(n<m \Rightarrow (A, n, c) \prec (A, m, c)\).
 For a set of prospects \(S\), let \(S+m\) be the set derived by adding \(m\) to each prospect in \(S\). We require \(Ch'(S)+m=Ch'(S+m)\).
 We require that if the choice set contains more than one prospect, subtracting any positive amount of money from a single item removes it from the choice set. For example, if \((A, 0, \emptyset) \sim (B, 0, \emptyset)\), then for \(m>0\), \((A, m, \emptyset) \prec (B, 0, \emptyset)\).
 For each set of prospects \(S\), there is a quantity of money such that we can subtract it from all prospects in \(Ch'(S)\) (leaving the rest of \(S\) the same) without changing the choice set. That is, \(\exists n Ch'(SCh'(S)+(Ch'(S)n))=Ch'(S)n\). (This is a way of saying that a strict preference implies a preference we’re willing to pay for – money has small enough units to be less important than anything else.)
 For each set of prospects \(S\) such that \(Ch'(S) \subset S\), there is a quantity of money \(n\) such that we can subtract it from all the prospects in \(Ch'(S)\) (leaving the rest of \(S\) the same), all those elements would be excluded from the new choice set. That is, \(\exists n Ch'(SCh'(S)+(Ch'(S)n)) \cap Ch'(S) = \emptyset\). (This is a way of saying that any preference can be overcome with enough money.)
 Contracts are valued independently of each other and of the amount of money the agent has; IE, \((A, m, c) \sim (A, m+n, \emptyset)\) then \((A, m', c \uplus d) \sim (A, m'+n, d)\) for all \(m' \in M, d \in (B \times M) \rightarrow M\).
Proof. Let \(M\) be the ordered field defined by rationalcoefficient polynomials in \(\epsilon\), considering integer powers of \(\epsilon\) and taking \(\epsilon^0=1\) and \(a \epsilon^n < b \epsilon^{n1}\) for all \(n \in \mathbb{Z}, a,b \in \mathbb{Q}\).
For a set of prospects \(S\), let \(Ch'(S)\) be the set chosen by the following process: order the prospects first by the negativepower elements of the money alone, discarding any prospects which are nonmaximal in this respect, to yield \(S'\); Apply \(Ch()\) to the set of propositions of prospects in \(S'\), keeping all prospects whose propositions would be kept by \(Ch()\); finally, order the remaining set by money (considering nonnegative powers in the polynomials this time), keeping only the maximal elements. In other words, we first consider the infinite amounts of money; then, we consider what \(Ch()\) would do; finally, we consider the finite and infinitesimal amounts of money. This definition of \(Ch'()\) satisfies all properties above. \(\Box\)
Note that the given construction of \(Ch'()\) is not necessarily the one the agent will use; for example, most agents typically considered would be betterrepresented by taking \(M=\mathbb{R}\) and assigning real values to propositions. Rather, this lemma is just to show that my assumptions about how the agent’s preferences are extended to prospects aren’t restricting the agent’s native preferences on propositions at all. Any preferences on propositions can be extended to prospects in a way which obeys these rules. The same could not be said of other similarly natural assumptions, for example assuming all of the above while requiring realvalued money. We don’t want to sneak in restrictions on agent’s preferences via assumptions about money; the money should only serve to facilitate dutchbook arguments.
Henceforth, \(Ch'()\) refers to some function which obeys the properties from lemma 1.
As for the question of why these particular assumptions are made rather than some other set, this is at the level of asking why an agent should care about dutchbook or moneypump arguments, and I’ll make little attempt to answer that here. The assumptions are made with the express purpose of facilitating the proof. One way to look at it is that we’re asking the agent hypothetical questions, augmenting the propositions the agent understands with totally imaginary objects called “money” and “contracts”. The possibility of our assumptions about these being “wrong” is meaningless. Instead, the question is whether arguments employing such hypotheticals to conclude various principles of rationality are compelling.
Games
The agent plays games with the bookie, as follows:
 The game proceeds in rounds. At each round, the agent is “holding” some prospect. In the initial round, the agent holds a prospect given by the bookie (the “starting prospect”).
 The bookie can move the game to the next round in two ways:
 The bookie can offer the agent a set of prospects \(S\) (“choice round”). The set must include the prospect which the agent is currently holding. The agent chooses one of the prospects, according to \(Ch'(S)\). If \(Ch'(S)\) contains several prospects, we let the bookie choose. The agent holds the chosen prospect in the next round.
 The bookie can test a proposition (“test round”). This refines what the agent is holding according to whether the test comes out true or false. In addition, contracts pay out if they are triggered by the new proposition. More specifically: if the agent is holding \((P, m, c)\) in this round, and the bookie tests \(Q\), then the agent either holds \((P \wedge Q, m+n_1, c_1)\) in the next round or \((P \wedge \neg Q, m_2, c_2)\). \(c_1\) is \(c\) minus any contracts \([R, n]\) such that \(P \wedge Q \rightarrow R\); the quantity \(n_1\) is the sum of the payouts of those contracts. (The multiset payout of \(n\) copies of a contract \([R,m]\) is \(n \cdot m\).) Similarly, \(c_2\) subtracts the contracts activated by the other case, whose payouts are summed up in \(n_2\). We can never move to a prospect whose proposition is \(\bot\); so, sometimes there will only be one option.
 The bookie can end play at any round.
 I restrict games to have all offers before all tests, so that games proceed in two phases; in phase one, the bookie presents the agent with a sequence of choices, while in phase two, the bookie tests propositions in order to pay out contracts. I don’t think this restriction makes any difference except to simplify matters.
(Letting the bookie choose when the agent is indifferent is a convenience; we could consider the agent’s response to be random, but we wouldn’t want to consider an agent immune to dutchbook if it sometimes escaped them via random choice. We’d condemn the agent if it had a chance of being dutchbooked. So, it’s simpler to just say that the bookie chooses.)
Fixing a particular bookie strategy and outcomes for each test round, we get a playout. Suppose the agent starts off holding \((A, m, c)\). Call the prospect which the agent actually holds at the end of the playout \(Q\). Then an agent experiences regret if, in every situation, \(Q\) is as bad or worse than it would have if it had stuck with the starting prospect. More formally, regret is defined in two cases:
 If the last prospect held before any test rounds begin is \((A, n, d)\) (IE, we hold the starting proposition), then take the starting prospect through the same sequence of test rounds (if any) with the same outcomes to get a comparison prospect \(P\). This is the endcondition which would have resulted if the agent had stuck with the initial prospect, but the bookie had run the same tests and they had come out the same way. If \(Q \preceq P\), the agent has regret. If \(Q \prec P\), the regret is strict.
 If the last prospect before test rounds doesn’t have proposition \(A\), then instead, take the starting prospect and generate the set \(P\) of all possible results if the agent had stuck with the starting prospect, and the bookie had performed the same tests, but the tests could go either way within the limits of logical possibility. In this case, the agent is only said to experience regret if \(Q\) is less than or equal to every element of \(P\). The regret is strict if \(Q\) is strictly less than any element of \(P\).
A bookie’s strategy is a generalized dutchbook if the agent regrets every possible playout, and strictly regrets at least one playout.
My definition of regret is a bit clunky. The intuition behind splitting up the cases in this way can be understood by a couple of examples.
Suppose the agent starts with prospect \((A, 0, \emptyset)\). The bookie offers the choice of trading this for \((A, 10, \{[B, 1]\})\), which the agent accepts. This is interpreted as paying $10 for a $1 bet on \(B\). The bookie then tests for \(B\), which comes up true. The agent now holds \((A \wedge B, 9, \emptyset)\). Clearly, the agent should regret this outcome. If it had stuck with \((A, 0, \emptyset)\), it would have \((A \wedge B, 0, \emptyset)\) after a successful test for \(B\), which is strictly preferred by my assumptions concerning money.
On the other hand, suppose that the agent starts with \((A, 0, \emptyset)\) and is offered the trade of \((A \wedge B, 1, \emptyset)\), which it prefers. The bookie then tests \(B\), which can only come out true. The agent now has \((A \wedge B, 1, \emptyset)\). In this case, it doesn’t make sense to say that the agent could have had \((A \wedge B, 0, \emptyset)\) if it had only declined the trade. \(B\) came out true because of the trade. To establish regret in this case, we would want both \((A \wedge B, 1, \emptyset) \leq (A \wedge B, 0, \emptyset)\) and \((A \wedge B, 1, \emptyset) \leq (A \wedge \neg B, 0, \emptyset)\).
Still, I’m not totally happy comparing to the starting prospect in this way. It would be more natural to compare the agent to agents with differing preferences: an agent has (strict) regret if some other preferences would have given it (strictly) better outcomes, given the bookie’s strategy. We then deem a system of preferences \(Ch'()\) irrational if some other system of preferences achieves superior results even by the judgement of \(Ch'()\). However, that definition wouldn’t work here; bookies could reward irrationality, making every preference system dutchbookable. The definition I use avoids this.
Arguments for Necessity
Here, I prove a number of properties on the assumption that the agent is not susceptible to generalized dutchbooks.
We can show that all preferences reduce to binary preference (a version of Independence of Irrelevant Alternatives):
Theorem 1 (Reduction to Binary Preference). If \(Ch'()\) is not susceptible to a generalized dutchbook, then \(Ch'(S)\) is exactly the set of prospects \(P \in S\) such that \(Q \preceq P\) for all \(Q \in S\).
Proof. Suppose not. Then either there is a \(A \in Ch'(S)\) with a \(B \in S\) such that \(A \prec B\), or otherwise, there is a \(A \in S\) with no such \(B\) but \(A \notin Ch'(S)\).
In the first case, the bookie can start the agent with \((B, 0, \emptyset)\), present the agent with the set of choices \(S\), and make the agent choose \((A, 0, \emptyset)\). At this point, the bookie can offer \((B, m, \emptyset)\), with \(m\) sufficiently small so as to be favorable. The agent is now strictly worse off than it started, contradicting the assumption that it has no generalized dutchbooks.
In the second case, start the agent with \(A\), and present the choice of \(S\). The agent will choose something other than \(A\). Now the bookie can charge to switch back, offering \((A, m, \emptyset)\). Again, this should be impossible. \(\Box\)
Here’s the classic moneypump:
Theorem 2 (Transitivity). If \(Ch'()\) is not susceptible to a generalized dutchbook, then whenever \(A \preceq B\) and \(B \preceq C\), \(A \preceq C\).
Proof. Suppose not. Then we can find \(A,B,C\) such that \(A \leq B\) and \(B \leq C\), but \(C < A\). The bookie can start the agent holding \((A, 0, \emptyset)\) and offer the choice to switch to \((B, 0, \emptyset)\) and then \((C, 0, \emptyset)\). The agent either strictly prefers these or is indifferent; in either case, the bookie can get the agent to switch. Since \(C < A\), the bookie can now offer \((A, m, \emptyset)\). By the properties of money, there exists an \(m\) small enough to ensure this trade is favorable. The agent is now strictly worse off than it started. \(\Box\)
Note that binary preference is complete by definition, so we have complete, transitive preferences. Also note that transitivity of \(\preceq\) implies transitivity of \(\prec\) and of \(\sim\).
Now we prove a version of Jeffrey’s law of averaging:
Theorem 3 (Averaging). Suppose \(Ch'()\) is not susceptible to a generalized dutchbook. If \(A \wedge B = \bot\), then \(A \preceq B\) implies \(A \preceq A \vee B \preceq B\).
Proof. Suppose not. Then by transitivity, either the disjunction is strictly preferred to both disjuncts, or both disjuncts are strictly preferred to it.
In the first case, suppose wlog that \(A \preceq B\). Start the agent with \((B, 0, \emptyset)\). Offer the choice to switch to \((A \wedge B, m, \emptyset)\) with \(m\) small enough to be appealing. The agent accepts. Then, test whether \(A\). The agent either ends up with \((A, m, \emptyset)\) or \((B, m, \emptyset)\). In both cases, it experiences strict regret.
In the second case, suppose again that \(A \preceq B\) wlog. Start the agent with \((A \vee B, 0, \emptyset)\) and charge \(m\) to switch to \(A\). Then, test for \(A\). This creates strict regret, since the agent would have ended up in either \((A, 0, \emptyset)\) or \((B, 0, \emptyset)\) if it did nothing, both of which are better than \((A, m, \emptyset)\). \(\Box\)
Next, we want to make classic dutchbook arguments to establish probability laws. To do this, however, we need to establish some properties of \(Ch'()\). Specifically, we can show from transitivity and completeness that prospects act like values which extend the ordered field \(M\).
Definition. Suppose that \(M\) is isomorphic with a subfield of the surreal numbers. Fix one such subfield to identify with \(M\). Also fix an arbitrary wellordering of prospects, \(\lessdot\), which will act like the surreal ordering of stages. Then the relative value of prospect \(P = (A,m,c)\) relative to prospect \(Q=(B,n,d)\), denoted \(V_Q(P)\), measures the prices at which the agent will accept offers to switch: it is defined as the surreal number \(\{ L  R \}\) where \(L\) is the set of monetary values \(v\) such that \((B,n+v,d) \prec P\), plus those values \(V_Q(P')\) where \(P' \prec P\) and \(P' \lessdot P\). \(R\) is the set of monetary values \(v\) such that \(P \prec (B,n+v,d)\), plus those values \(V(P')\) where \(P \prec P'\) and \(P' \lessdot P\). The value (nonrelative) shall be defined as \(V(P) = V_{(\top, 0, \emptyset)}(P)\).
(There are broad conditions under which \(M\) can be embedded into the surreal numbers as required here; in NBG set theory, this is always possible.)
Lemma 2. If \(M\) is isomorphic to a subfield of the surreal numbers, then the relative value given above is welldefined, and the closure of all prospect values under the field operations is an ordered field. Furthermore, \(V(P)<V(Q)\) if and only if \(P \prec Q\).
Proof. Due to completeness, any prospect \(A\) splits the set of values so far (IE, \(M\) plus all \(A' \lessdot A\)) into disjoint sets worth less than, more than, and (possibly) the same as the trade of \(\top\) for \(A\). Call the first set \(L\) and the second \(R\). Due to transitivity, it must be that any element from \(L\) is less than any element from \(R\). We can conclude that \(V(A)\) is a wellformed surreal number. We can therefore take the closure under field operations to get a new subfield of the surreals, which will itself be an ordered field.
Suppose \(V(A)<V(B)\), with \(V(A) = \{ L  R \}\) and \(V(B) = \{ L'  R' \}\). By the definition of ordering on surreal numbers, there must either be an \(n \in R\) such that \(n \leq \{ L'  R' \}\), or an \(n \in L'\) such that \(\{ L  R \} \leq n\). If \(n \in M\), let \(A' = (\top, n, \emptyset)\); otherwise, \(n\) is \(V(A')\) for some \(A' \lessdot A\). So, we have either \(A \prec A' \preceq B\) or \(A \preceq A' \prec B\). In either case, \(A \prec B\) by transitivity.
Now, suppose \(A \prec B\). Either \(A \lessdot B\) or \(B \lessdot A\). In the first case, \(V(B)\) must have \(V(A)\) in its left set; in the second case, \(V(A)\) must have \(V(B)\) in its right set. Either way, \(V(A) < V(B)\). \(\Box\)
Ordinarily, after getting a notion of value like this we’d like to show that it is unique up to linear transformations or something similar. This type of result is very unlikely here, since the arbitrary choice of \(\lessdot\) can result in significant differences in \(V()\) (on top of the already nonunique choice of \(Ch'()\) to represent a given \(Ch()\)). Nonetheless, we have the first half of a representation theorem. We can use this to define probability.
For notational convenience, define the value of a contract \(V_P(c)\) to be the value of adding that contract to the contract set of prospect \(P\), with \(V(c)=V_{(\top, 0, \emptyset)}(c)\). We define probability via the value of $1 bets:
Definition. The probability of a propositions \(Pr(A)\) is defined as the value \(V ([A, \$1])\).
Theorem 4 (Probability Laws). If \(Ch'()\) has no generalized dutchbooks,
 \(Pr(A) \geq 0\) (NonNegativity).
 \(Pr(A) = 1\) if \(A\) is a tautology (Normalization).
 If \(A \wedge B = \bot\), then \(Pr(A \vee B) = Pr(A) + Pr(B)\) (Finite Additivity).
 If \(A \neq \bot\), $Pr(A)>0 (NonDogmatism).
Proof. (Nonnegativity.) Suppose \(Pr(A) < 0\). This means \((\top, 0, \{ [A,1] \} ) \prec (\top, 0, \emptyset)\). But since a strict preference implies a preference we’re willing to pay for, \((\top, 0, \{ [A,1] \} ) \preceq (\top, c, \emptyset)\) for some \(c>0\). A game which offers that trade and then tests \(A\) is a generalized dutchbook. The agent is worse off by \(c\) in the case where \(A\) comes out false, and worse off by \(1+c\) if \(A\) comes out true. So, this can’t happen.
(Normalization.) Suppose \(A\) is a tautology and \(Pr(A) < 1\). This is a preference it’s willing to pay for, so \((\top, 0, \{ [A,\$1] \} ) \prec (\top, 1n, \emptyset)\) for some \(n>0\). But this implies that the agent can be generaldutchbooked by starting it out with \((\top, 0, \{ [A,\$1] \} )\), offering it the trade for \((\top, 1n, \emptyset)\), and then testing for \(A\) (which will certainly come true); the agent could have had $1 rather than $1n. Similarly, if \(Pr(A) > 1\), we can start the agent with \((\top, 1+n, \emptyset)\) for some \(n>0\), and get the agent to trade for \((\top, 0, \{ [A,1] \} )\), ultimately leaving it with only \((\top, 1, \emptyset)\) after testing \(A\). So \(Pr(A)=1\).
(Finite Additivity.) Suppose \(A \wedge B = \bot\). Since \(A\) and \(B\) are mutually exclusive, the agent must be indifferent between \((A \vee B, 1)\) and the pair of contracts \([A, 1]\), \([B, 1]\). (Holding that pair of contracts pays out in exactly the same way as holding \([A \vee B, 1]\), so if they aren’t valued equally, then the bookie can charge a small amount for switching from one to the other to make a dutch book.) However, the pair of contracts must be valued as \(V([A,1]) + V([B,1])\); otherwise, the amount of money the agent is willing to pay for a direct offer of the pair would be different than what the agent would be willing to pay if offered first \([A, 1]\) and then \([B, 1]\). In the case where \(V([A,1]) + V([B,1]) > V(\{ [A,1], [B,1] \} )\), the bookie can start the agent out holding both \([A, 1]\) and \([B, 1]\), pay the agent an amount of money slightly more than \(V(\{ [A,1], [B,1] \} )\) but less than \(V([A,1]) + V([B,1])\) (a quantity of money whose existence is assured by orderdensity) to give them up, and then charge individually to give them back. In the reverse case, the bookie would pay for their removal individually and then charge to give them back jointly. Either way, we have a dutch book.
(NonDogmatism.) Suppose \(A \neq \bot\) and \(Pr(A)=0\). The bookie can start the agent with \((\top, 0, \{ [A,1] \} )\) and offer \((\top, 0, \emptyset)\), which the agent is willing to take, and then test \(A\). If \(A\), the agent is worse off by one dollar; otherwise, the outcome is the same as it would have been. So, this is a generalized dutch book. \(\Box\)
So, we’ve got our probability and utility functions. We just need to do a little more work to connect them to each other.
Lemma 3 (Exchange Rate). Probabilities are exchange rates between money and conditional bets: \(V([A, m]) = m Pr(A)\).
Proof. Remember that by a property of money, \((A, m, d \uplus \{ [B, x] \}) \preceq (A, m+n, d)\) if and only if \((A, m', d' \uplus \{ [B,x] \}) \preceq (A, m'+n, d')\) for all \(m', d'\). This implies that \(V_{(A, n, d)}(c)\) depends on only \(A\) and \(c\). In particular, the value is independent of the number of copies of the contract already in \(d\). Since \(n\) copies of a contract \([A, m]\) will have equivalent payouts to one copy of a contract \([A, nm]\), it must have the same value to avoid a generalized dutch book. Since the multiset of contracts allows the number of copies of a contract to be anything in \(M\), this argument applies for any \(n \in M\). Since \(M\) has multiplicative inverses, for any \(m\) but 0 we can take \(n=1/m\), proving the result. The result also holds for \(m=0\), since the value of a contract paying zero must be zero. \(\Box\)
In what follows, I will abbreviate \(V((A,0,\emptyset))\) as \(V(A)\).
Theorem 5 (Expected Utility). If propositions \(A\) and \(B\) are mutually exclusive and \(Ch'()\) has no generalized dutchbooks, \(V(A \vee B) Pr(A \vee B) = V(A) Pr(A) + V(B) Pr(B)\).
Proof. Suppose \(V(A \vee B) Pr(A \vee B) < V(A) Pr(A) + V(B) Pr(B)\). Then for any \(m, m', m'' \in M\) such that \(m<V(A \vee B)\), \(m'>V(A)\), \(m''>V(B)\) we have \(m Pr(A \vee B) < m' Pr(A) + m'' Pr(B)\). Taking the negative of both sides and applying the exchange rate lemma, we have \(V([A \vee B, m]) > V([A, m'])+V([B, m''])\). This means there is a price, \(p\), which the agent is willing to pay in order to trade the two contracts \([A, m]\) and \([B, m'']\) for the contract \([A \vee B, m]\). Choose \(m, m', m''\) so that \(V(A \vee B)m<p\), \(m'V(A)<p\), and \(m''V(B)<p\). Now, an agent who pays \(p\) for the trade (starting from \((\top, 0, \{ [A, m],[B, m''] \})\) and being offered \((\top, p, \{ [A \vee B, m] \})\)) is strictly worse off in every outcome after \(A\) and \(B\) have been tested, as compared with an agent who didn’t. This contradicts our assumption that there are no generalized dutchbooks.
Now suppose \(V(A \vee B) Pr(A \vee B) > V(A) Pr(A) + V(B) Pr(B)\). By a similar application of the lemma, we get \(V([A \vee B, m]) < V([A, m'])+V([B, m''])\) and make the agent pay for the trade in the opposite direction. This also contradicts our assumption. So we must have the desired result. \(\Box\)
This completes the proof that an agent immune to generalized dutch books must have preferences which can be represented by (nonstandard) probability and utility functions obeying the law of expected utility. This in itself does not tell us much, because it may be that I can argue all sorts of constraints from the assumption that no generalized dutch book exists – the condition could even be unsatisfiable. Next we want to see that preferences being representable as probability and utility functions is sufficient.
Argument for Sufficiency
Theorem 6 (Sufficiency). If \(Ch()\) can be represented as taking the highest\(V()\) option according to a (possibly nonstandard) \(V()\) on propositions (except \(\bot\)) which obeys the law of expected utility as mediated by a (possibly nonstandard) \(Pr()\) function which follows the probability laws, then there exists a \(Ch'()\) which is immune to generalized dutch books.
Proof. Define a value on prospects, \(V'((A,m,c))= V(A)+m+\sum_{[B,n] \in c} c([B,n]) n Pr(B)\), where \(c([B,n])\) gives the multiset count of the contract \([B,n]\) in \(c\). Let \(Ch'()\) choose the subset with maximal \(V'\). This definition of \(V'\) obeys a generalized expected value rule, in which the value of a prospect is the expected value of all possible outcomes after applying any combination of test rounds to the prospect. Now, if \(Ch'()\) is willing to trade during any choice rounds, it must be for a prospect with higher or equal expected value. This makes a generalized dutchbook impossible. There are two cases to consider, based on the definition of regret. Either the agent has traded for a prospect whose proposition is the same as the starting proposition, or the agent has traded for one which is different. In the first case, the probabilities of different test outcomes all remain the same. It is not possible that each outcome is the same or worse as a result of the trade, with at least one being worse; the expected utility would have been lower, and no trade would have been made. In the second case, the probabilities may change. However, due to nondogmatism, all possibilities still have positive probability. It is therefore not possible that every outcome after trade is the same as or worse than every possible outcome of the prospect before trade, with at least one of the new worse than every old; this would assure a lower expected utility, preventing trade. \(\Box\)
Now, it follows from results in the previous section that a \(Ch'()\) which is immune to generalized dutchbooks implies a \(Pr()\) and \(V()\) following the law of expected utility, which represent the original preferences \(Ch()\). So, combined with theorem 6, we’ve got necessary and sufficient conditions for such a representation.
Discussion
I still feel uncomfortable with certain aspects of this, especially the assumptions which I had to edit as I went to make the arguments go through. The most glaring case is the long list of assumptions about money. Other bits I feel uneasy about are the Mvalued multisets of contracts and the definition of regret. It’s not a flaw in the formal argument that worries me, but rather, the question of how much contrivance we can throw into the setup. With a few different choices in definitions, would I get a significantly different decision theory?
The overall structure of the argument is that we propose a set of thought experiments to an agent whose choice function (on nonthoughtexperiments) is \(Ch()\). The agent is asked to construct a function \(Ch'()\) representing what it would do under the conditions of the thought experiments. It can construct any \(Ch'()\) it wants, so long as it obeys some assumptions we make as part of the thought experiment. However, if it gives us a \(Ch'()\) which violates some rule of classical decision theory, we give it back a generalized dutchbook illustrating a case where \(Ch'()\) seems “inconsistent”: suboptimal by its own standards.
From these thought experiments, the agent is not only supposed to arrive at a “consistent” \(Ch'()\); it is supposed to be motivated to revise \(Ch()\) if necessary to do the job. Presumably, this is because “inconsistencies” in the thought experiments are supposed to indicate real inconsistencies in \(Ch()\) (where the system of preferences itself judges some other system to be better, in some sense). Of course, this isn’t directly true.
Perhaps a better way of thinking about it is not that we’re trying to convince an agent to change its own preferences, but that we’re trying to convince an agent’s designer to give it coherent preferences in the first place. Still, it’s unclear why the designer should pay special attention to this class of hypothetical scenarios.
I did the whole argument this way to avoid “structural” assumptions, where the agent’s beliefs are assumed to already contain things like fair coins in order to define probability, and so on. In the end, though, an agent may only find these hypotheticals convincing to the extent that they resemble the structure of situations it actually believes in.
Perhaps arguments based on money can be seen as making transitivity and other decisiontheoretic properties “contagious”: if there is something you care about approximately independently of everything else, which has properties of money, then you can argue for clean decisiontheoretic properties for everything else based on that one thing.
However, some aspects seem strange even with this kind of thinking. One of the basic aspects of moneypump arguments, which I’ve faithfully replicated here, is that the agent apparently must “forget” previous choices, and decide only on the basis of the current choice in front of it. I think there is a strong case to be made that by requiring a choice to be made only as a function of the prospects on offer in a given round, we’re not letting the agent fully understand the game it is playing. This leads to objections such as “you can refuse further transactions when you notice a moneypump” (for a discussion, see Money Pumps, Diachronic and Synchronic, Yair Levy).
In any case, these are questions which I hope to answer more deeply in the next stage. Now that I have a version of classical DT justified exclusively by generalized dutchbook, I’ll be thinking about how to adapt this kind of thing to logical uncertainty and perhaps other MIRI problems. I won’t promise another post in the series; it might not go anywhere, or I might decide that the expected value is low and I should do other things for a while. Hopefully this post has some value.
