# VNM agents and lotteries involving an infinite number of possible outcomes

Summary: The VNM utility theorem only applies to lotteries that involve a finite number of possible outcomes. If an agent maximizes the expected value of a utility function when considering lotteries that involve a potentially infinite number of outcomes as well, then its utility function must be bounded.

### Outcomes versus Lotteries

One way to formulate the VNM utility theorem is in terms of outcomes and lotteries over outcomes. That is, there is some set ![](http://www.codecogs.com/png.latex?\mathcal{O}) of outcomes, and a set ![](http://www.codecogs.com/png.latex?\mathcal{L}) of lotteries defined as ![](http://www.codecogs.com/png.latex?{\displaystyle%20\mathcal{L}:=\left\{%20\sum_{i=1}^{n}p_{i}O_{i}\mid%20n\in\mathbb{N},p_{i}%3E0,O_{i}\in\mathcal{O}\left%28\forall%20i\right%29,\sum_{i=1}^{n}p_{i}=1\right\}%20}). In other words, the set of lotteries is the set of probability distributions over a finite number of outcomes. The finiteness is very important; we'll get to that later. Note that for each outcome, there is a corresponding lottery that guarantees this outcome, and these “pure outcome” lotteries are a basis for ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BL%7D).

Given that formulation, and given the [VNM axioms](http://en.wikipedia.org/wiki/Von_Neumann%E2%80%93Morgenstern_utility_theorem#The_axioms), there exists some function ![](http://www.codecogs.com/png.latex?u:\mathcal{O}\rightarrow\mathbb{R}) such that given any 2 lotteries ![](http://www.codecogs.com/png.latex?{\displaystyle%20L:=\sum_{i=1}^{n}p_{i}O_{L,i}}) and ![](http://www.codecogs.com/png.latex?{\displaystyle%20M:=\sum_{i=1}^{m}q_{i}O_{M,i}}), ![](http://www.codecogs.com/png.latex?L\succ%20M) [iff](http://en.wikipedia.org/wiki/If_and_only_if) ![](http://www.codecogs.com/png.latex?{\displaystyle%20\sum_{i=1}^{n}p_{i}u\left%28O_{L,i}\right%29%3E\sum_{i=1}^{m}q_{i}u\left%28O_{M,i}\right%29}).

The other formulation does not mention ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BO%7D). Instead, there is simply a set ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BL%7D) of lotteries, such that ![](http://www.codecogs.com/png.latex?{\displaystyle%20\forall%20L_{1},L_{2},...,L_{n}\in\mathcal{L},\forall%20p_{1},p_{2},...,p_{n}%3E0\,\sum_{i=1}^{n}p_{i}L_{i}\in\mathcal{L}}) iff ![](http://www.codecogs.com/png.latex?{\displaystyle%20\sum_{i=1}^{n}p_{i}=1}). In this formulation, there exists some function ![](http://www.codecogs.com/png.latex?u:\mathcal{L}\rightarrow\mathbb{R}) such that if ![](http://www.codecogs.com/png.latex?{\displaystyle%20L=\sum_{i=1}^{n}p_{i}L_{i}}), then ![](http://www.codecogs.com/png.latex?{\displaystyle%20u\left%28L\right%29=\sum_{i=1}^{n}p_{i}u\left%28L_{i}\right%29}) (notice ![](http://www.codecogs.com/png.latex?n) still must be finite) and for any 2 lotteries ![](http://www.codecogs.com/png.latex?L) and ![](http://www.codecogs.com/png.latex?M), ![](http://www.codecogs.com/png.latex?L%5Csucc%20M) iff ![](http://www.codecogs.com/png.latex?u\left%28L\right%29%3Eu\left%28M\right%29).

The formulation in terms of outcomes and lotteries over outcomes is more intuitively appealing (to me, at least), since real life has outcomes and uncertainty about outcomes, so I will use it when I can, but the formulation purely in terms of lotteries, which is more similar to what von Neumann and Morgenstern did in their original paper, will be useful sometimes, so I will switch back to it intermittently.

### Infinite lotteries

Myth: Given some utility function ![](http://www.codecogs.com/png.latex?u:%5Cmathcal%7BO%7D%5Crightarrow%5Cmathbb%7BR%7D) that accurately describes a VNM-rational agent's preferences over finite lotteries, if you expand ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BL%7D) to include lotteries with an infinite number of possible outcomes (let's call the expanded set of lotteries ![](http://www.codecogs.com/png.latex?\mathcal{L}^{+})), then for any 2 lotteries ![](http://www.codecogs.com/png.latex?{\displaystyle%20L:=\sum_{i=1}^{\infty}p_{i}O_{L,i}}) and ![](http://www.codecogs.com/png.latex?{\displaystyle%20M:=\sum_{i=1}^{\infty}q_{i}O_{M,i}}), ![](http://www.codecogs.com/png.latex?L%5Csucc%20M) iff ![](http://www.codecogs.com/png.latex?{\displaystyle%20\sum_{i=1}^{\infty}p_{i}u\left%28O_{L,i}\right%29%3E\sum_{i=1}^{\infty}q_{i}u\left%28O_{M,i}\right%29}).

Reality: Knowing an agent's preferences over finite lotteries, and that the agent obeys the VNM axioms, does not tell you everything about the agent's preferences over lotteries with an infinite number of possible outcomes. To demonstrate this, I'm going to construct a VNM-rational agent that maximizes a utility function ![](http://www.codecogs.com/png.latex?u:\mathcal{L}^{+}\rightarrow\mathbb{R}), where ![](http://www.codecogs.com/png.latex?{\displaystyle%20\exists\left\{%20L_{i}\right\}%20_{i=1}^{\infty}\in\mathcal{L}^{+}\,\exists\left\{%20p_{i}\left%28\geq0\right%29\right\}%20_{i=1}^{\infty}\,\sum_{i=1}^{\infty}p_{i}=1,\,%20u\left%28\sum_{i=1}^{\infty}p_{i}L_{i}\right%29\neq\sum_{i=1}^{\infty}p_{i}u\left%28L_{i}\right%29}). This construction relies on the axiom of choice (please let me know if you figure out whether or not it is possible to construct such an agent without the axiom of choice). I will also be assuming that ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BO%7D) is countably infinite (if ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BO%7D) is finite, such an agent is impossible, and if it is uncountable, then you can consider a countable subset).

Notice that ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BL%7D%5E%7B+%7D) can be seen as a subset of the real vector space ![](http://www.codecogs.com/png.latex?{\displaystyle%20\mathcal{V}:=\left\{%20\sum_{O\in\mathcal{O}}\alpha_{O}O\mid\forall%20O\in\mathcal{O}\,\alpha_{O}\in\mathbb{R},\,\sum_{O\in\mathcal{O}}\left|\alpha_{O}\right|\,%20converges\right\}%20}), with the addition and multiplication by scalar operations being exactly what you would expect (![](http://www.codecogs.com/png.latex?{\displaystyle%20\left%28\sum_{O\in\mathcal{O}}\alpha_{O}O\right%29+\left%28\sum_{O\in\mathcal{O}}\beta_{O}O\right%29=\sum_{O\in\mathcal{O}}\left%28\alpha_{O}+\beta_{O}\right%29O}), and ![](http://www.codecogs.com/png.latex?{\displaystyle%20x\left%28\sum_{O\in\mathcal{O}}\alpha_{O}O\right%29=\sum_{O\in\mathcal{O}}x\alpha_{O}O})). A utility function ![](http://www.codecogs.com/png.latex?u) can be seen as an element of the dual space of ![](http://www.codecogs.com/png.latex?\mathcal{V}). The axiom of choice implies that this vector space has a basis (in this context, a basis means a set of vectors for which any finite subset is linearly independent, and every vector is a linear combination of a finite number of basis vectors). The value of ![](http://www.codecogs.com/png.latex?u) on each basis element can be chosen independently, and these choices completely determine ![](http://www.codecogs.com/png.latex?u). In particular, the basis could contain every element of ![](http://www.codecogs.com/png.latex?%5Cmathcal%7BO%7D), and also contain ![](http://www.codecogs.com/png.latex?{\displaystyle%20\sum_{i=1}^{\infty}2^{-i}O_{i}}) for some sequence ![](http://www.codecogs.com/png.latex?\left\{%20O_{i}\in\mathcal{O}\right\}%20_{i=1}^{\infty}) with distinct elements. Then we could have ![](http://www.codecogs.com/png.latex?\forall%20O\in\mathcal{O}\,%20u\left%28O\right%29=0) and ![](http://www.codecogs.com/png.latex?{\displaystyle%20u\left%28\sum_{i=1}^{\infty}2^{-i}O_{i}\right%29=1}), violating the conclusion of the myth, but this meets all the VNM axioms.

The fact that there is a real-valued function on lotteries that the agent maximizes guarantees that the completeness and transitivity axioms hold, since ![](http://www.codecogs.com/png.latex?u\left%28L\right%29%3Eu\left%28M\right%29) or ![](http://www.codecogs.com/png.latex?u\left%28L\right%29=u\left%28M\right%29) or ![](http://www.codecogs.com/png.latex?u\left%28L\right%29%3Cu\left%28M\right%29) (completeness), and if ![](http://www.codecogs.com/png.latex?u\left%28L\right%29\leq%20u\left%28M\right%29) and ![](http://www.codecogs.com/png.latex?u\left%28M\right%29\leq%20u\left%28N\right%29) then ![](http://www.codecogs.com/png.latex?u\left%28L\right%29\leq%20u\left%28N\right%29) (transitivity). The fact that the function is linear with respect to finite sums guarantees that the continuity and independence axioms hold, since if ![](http://www.codecogs.com/png.latex?u\left%28L\right%29%3Cu\left%28M\right%29%3Cu\left%28N\right%29) then ![](http://www.codecogs.com/png.latex?u\left%28\frac{u\left%28N\right%29-u\left%28M\right%29}{u\left%28N\right%29-u\left%28L\right%29}L+\frac{u\left%28M\right%29-u\left%28L\right%29}{u\left%28N\right%29-u\left%28L\right%29}N\right%29=\frac{u\left%28N\right%29-u\left%28M\right%29}{u\left%28N\right%29-u\left%28L\right%29}u\left%28L\right%29+\frac{u\left%28M\right%29-u\left%28L\right%29}{u\left%28N\right%29-u\left%28L\right%29}u\left%28N\right%29=u\left%28M\right%29) (continuity), and if ![](http://www.codecogs.com/png.latex?u%5Cleft%28L%5Cright%29%3Cu%5Cleft%28M%5Cright%29) then for any lottery ![](http://www.codecogs.com/png.latex?N) and positive probability ![](http://www.codecogs.com/png.latex?p), ![](http://www.codecogs.com/png.latex?u\left%28pL+\left%281-p\right%29N\right%29=pu\left%28L\right%29+\left%281-p\right%29u\left%28N\right%29%3Cpu\left%28M\right%29+\left%281-p\right%29u\left%28N\right%29=u\left%28pM+\left%281-p\right%29N\right%29) (independence).

### Extended VNM hypothesis

The VNM utility theorem does not prove that an agent meeting its axioms will maximize the expected value of a utility function when presented with infinite lotteries, but the fact that any such agent will maximize the expected value of a utility function when presented with finite lotteries certainly seems very suggestive. With that in mind, I suggest that this be called the “extended von Neumann-Morgenstern hypothesis”:

An agent, in order to be considered rational, should maximize the expected value of a utility function over outcomes when choosing between lotteries over any (possibly infinite) number of outcomes.

### Bounded and unbounded utility functions

It is perfectly possible to construct VNM-rational agents with an unbounded utility function. But all such agents will inevitably violate the extended VNM hypothesis, because it is possible to create infinite lotteries with undefined expected value. For instance, the [St. Petersburg paradox](http://en.wikipedia.org/wiki/St._Petersburg_paradox) can be modified to refer specifically to utilities instead of money. That is, if there is no upper bound to the agent's utility function, then there exists a sequence of outcomes ![](http://www.codecogs.com/png.latex?\left\{%20O_{i}\right\}%20_{i=1}^{\infty}) such that for each ![](http://www.codecogs.com/png.latex?i), ![](http://www.codecogs.com/png.latex?u\left%28O_{i}\right%29\geq2^{i}). Then the expected utility of ![](http://www.codecogs.com/png.latex?{\displaystyle%20\sum_{i=1}^{\infty}2^{-i}O_{i}}) is ![](http://www.codecogs.com/png.latex?{\displaystyle%20\sum_{i=1}^{\infty}2^{-i}u\left%28O_{i}\right%29\geq\sum_{i=1}^{\infty}2^{-i}2^{i}=\sum_{i=1}^{\infty}1}), which does not converge. So unbounded utility functions are not compatible with the extended VNM hypothesis.

At this point, one may feel a strong temptation to come up with some way to characterize the values of infinite sums with some ordered superset of the real numbers, so that it is possible to compare nonconvergent sums. However, by the formulation of the VNM theorem solely in terms of lotteries, the utility of any lottery, such as ![](http://www.codecogs.com/png.latex?{\displaystyle%20u\left%28\sum_{i=1}^{\infty}2^{-i}O_{i}\right%29}), is a real number. So any such scheme that requires that the range of the utility function include nonreals will violate the VNM axioms. In particular, it will probably violate the archimedian axiom.

One possible response to this is to dismiss the archimedian axiom, and try to characterize agents that obey the completeness, transitivity, and independence axioms. Benja [has written](/lw/fu1/why_you_must_maximize_expected_utility/) (section "Doing without Continuity) about this, and I find his solution fairly compelling, but it isn't clear that it helps us deal with situations like the St. Petersburg paradox. I intend to say more about nonarchimedian preferences soon.