Utility representation theorem

In economics, a utility representation theorem asserts that, under certain conditions, a preference ordering can be represented by a real-valued utility function, such that option A is preferred to option B if and only if the utility of A is larger than that of B.

Background

Suppose a person is asked questions of the form "Do you prefer A or B?" (when A and B can be options, actions to take, states of the world, consumption bundles, etc.). If the agent prefers A to B, we write [math]\displaystyle{ A\succ B }[/math]. The set of all such preference-pairs forms the person's preference relation.

Instead of recording the person's preferences between every pair of options, it would be much more convenient to have a single utility function - a function u that assigns a real number to each option, such that [math]\displaystyle{ u(A)\gt u(B) }[/math] if and only if [math]\displaystyle{ A\succ B }[/math].

Not every preference-relation has a utility-function representation. For example, if the relation is not transitive (the agent prefers A to B, B to C, and C to A), then it has no utility representation, since any such utility function would have to satisfy [math]\displaystyle{ u(A)\gt u(B) \gt u(C) \gt u(A) }[/math], which is impossible.

A utility representation theorem gives conditions on a preference relation, that are sufficient for the existence of a utility representation.

Often, one would like the representing function u to satisfy additional conditions, such as continuity. This requires additional conditions on the preference relation.

Definitions

The set of options is a topological space denoted by X. In some cases we assume that X is also a metric space; in particular, X can be a subset of a Euclidean space R^m, such that each coordinate in {1,..., m} represents a commodity, and each m-vector in X represents a possible consumption bundle.

Preference relations

A preference relation is a subset of [math]\displaystyle{ X\times X }[/math]. It is denoted by either [math]\displaystyle{ \succ }[/math] or [math]\displaystyle{ \succeq }[/math]:

• The notation [math]\displaystyle{ \succ }[/math] is used when the relation is strict, that is, [math]\displaystyle{ A\succ B }[/math] means that option A is strictly better than option B. In this case, the relation should be irreflexive, that is, [math]\displaystyle{ A\succ A }[/math] does not hold. It should also be asymmetric, that is, [math]\displaystyle{ A\succ B }[/math] implies that not [math]\displaystyle{ B\succ A }[/math].
• The notation [math]\displaystyle{ \succeq }[/math] is used when the relation is weak, that is, [math]\displaystyle{ A\succeq B }[/math] means that option A is at least as good as option B (A may be equivalent to B, or better than B). In this case, the relation should be reflexive, that is, [math]\displaystyle{ A\succeq A }[/math] always holds.

Given a weak preference relation [math]\displaystyle{ \succeq }[/math], one can define its "strict part" [math]\displaystyle{ \succ }[/math] and "indifference part" [math]\displaystyle{ \simeq }[/math] as follows:

• [math]\displaystyle{ A\succ B }[/math] if and only if [math]\displaystyle{ A\succeq B }[/math] and not [math]\displaystyle{ B\succeq A }[/math].
• [math]\displaystyle{ A \simeq B }[/math] if and only if [math]\displaystyle{ A\succeq B }[/math] and [math]\displaystyle{ B\succeq A }[/math].

Given a strict preference relation [math]\displaystyle{ \succ }[/math], one can define its "weak part" [math]\displaystyle{ \succeq }[/math] and "indifference part" [math]\displaystyle{ \simeq }[/math] as follows:

• [math]\displaystyle{ A\succeq B }[/math] if and only if not [math]\displaystyle{ B \succ A }[/math];
• [math]\displaystyle{ A \simeq B }[/math] if and only if not [math]\displaystyle{ B \succ A }[/math] and not [math]\displaystyle{ A \succ B }[/math].

For every option [math]\displaystyle{ A \in X }[/math], we define the contour sets at A:

• Given a weak preference relation [math]\displaystyle{ \succeq }[/math], the weak upper contour set at A is the set of all options that are at least as good as A: [math]\displaystyle{ \{B\in X : B\succeq A \} }[/math]. The weak lower contour set at A is the set of all options that are at most as good as A: [math]\displaystyle{ \{B\in X : A \succeq B \} }[/math].
  • A weak preference relation is called continuous if its contour sets are topologically closed.
• Similarly, given a strict preference relation [math]\displaystyle{ \succ }[/math], the strict upper contour set at A is the set of all options better than A: [math]\displaystyle{ \{B\in X : B\succ A \} }[/math], and the strict lower contour set at A is the set of all options worse than A: [math]\displaystyle{ \{B\in X : A \succ B \} }[/math].
  • A strict preference relation is called continuous if its contour sets are topologically open.

Sometimes, the above continuity notions are called semicontinuous, and a [math]\displaystyle{ \succeq }[/math] is called continuous if it is a closed subset of [math]\displaystyle{ X\times X }[/math].^[1]

A preference-relation is called:

• Countable - if the set of equivalence classes of the indiffference relation [math]\displaystyle{ \simeq }[/math] is countable.
• Separable - if there exists a countable subset [math]\displaystyle{ Z\subseteq X }[/math] such that for every pair [math]\displaystyle{ A\succ B }[/math], there is an element [math]\displaystyle{ z_i\in Z }[/math] that separates them, that is, [math]\displaystyle{ A \succ z_i \succ B }[/math] (an analogous definition exists for weak relations).

As an example, the strict order ">" on real numbers is separable, but not countable.

Utility functions

A utility function is a function [math]\displaystyle{ u: X \to \mathbb{R} }[/math].

• A utility function u is said to represent a strict preference relation [math]\displaystyle{ \succ }[/math], if [math]\displaystyle{ u(A) \gt u(B) \iff A\succ B }[/math].
• A utility function u is said to represent a weak preference relation [math]\displaystyle{ \succeq }[/math], if [math]\displaystyle{ u(A) \geq u(B) \iff A \succeq B }[/math].

Complete preference relations

1. Reflexive and Transitive;
2. Complete, that is, for every two options A, B in X, either [math]\displaystyle{ A\succeq B }[/math] or [math]\displaystyle{ B\succeq A }[/math] or both;
3. For all [math]\displaystyle{ A \in X }[/math], both the upper and the lower weak contour sets are topologically closed;
4. The space X is second-countable. This means that there is a countable set S of open sets, such that every open set in X is the union of sets of the class S.^[2] Second-countability is implied by the following properties (from weaker to stronger):
   • The space X is separable and connected.
   • The relation [math]\displaystyle{ \succeq }[/math] is separable.
   • The relation [math]\displaystyle{ \succeq }[/math] is countable.

Jaffray^[3] gives an elementary proof to the existence of a continuous utility function.

Incomplete preference relations

Preferences are called incomplete when some options are incomparable, that is, neither [math]\displaystyle{ A\succeq B }[/math] nor [math]\displaystyle{ B \succeq A }[/math] holds. This case is denoted by [math]\displaystyle{ A \bowtie B }[/math]. Since real numbers are always comparable, it is impossible to have a representing function u with [math]\displaystyle{ u(A) \geq u(B) \iff A \succeq B }[/math]. There are several ways to cope with this issue.

One-directional representation

Peleg^[4] defined a utility function representation of a strict partial order [math]\displaystyle{ \succ }[/math] as a function [math]\displaystyle{ u: X \to \mathbb{R} }[/math] such that[math]\displaystyle{ A \succ B \implies u(A)\gt u(B) }[/math], that is, only one direction of implication should hold. Peleg proved the existence of a one-dimensional continuous utility representation of a strict preference relation [math]\displaystyle{ \succ }[/math] satisfying the following conditions:

1. Irreflexive and transitive (which implies that it is asymmetric, that is, is a strict partial order);
2. Separable;
3. For all [math]\displaystyle{ A \in X }[/math], the lower strict contour set at A is topologically open;
4. Spacious: if [math]\displaystyle{ A\succ B }[/math], then the lower strict contour set at A contains the closure of the lower strict contour set at B.
   • This condition is required for incomplete preference relations. For complete preference relations, every relation in which all lower and upper strict contour sets are open, is also spacious.

If we are given a weak preference relation [math]\displaystyle{ \succeq }[/math], we can apply Peleg's theorem by defining a strict preference relation: [math]\displaystyle{ A\succ B }[/math] if and only if [math]\displaystyle{ A\succeq B }[/math] and not [math]\displaystyle{ B\succeq A }[/math].^[4]

The second condition ([math]\displaystyle{ \succ }[/math] is separable) is implied by the following three conditions:

• The space X is separable;
• For all [math]\displaystyle{ A \in X }[/math], both lower and upper strict contour sets at A are topologically open;
• If the lower countour set of A is nonempty, then A is in its closure.

A similar approach was taken by Richter.^[5] Therefore, this one-directional representation is also called a Richter-Peleg utility representation.^[6]

Jaffray^[7] defines a utility function representation of a strict partial order [math]\displaystyle{ \succ }[/math] as a function [math]\displaystyle{ u: X \to \mathbb{R} }[/math] such that both [math]\displaystyle{ A \succ B \implies u(A)\gt u(B) }[/math], and [math]\displaystyle{ A\approx B \implies u(A)=u(B) }[/math], where the relation [math]\displaystyle{ A\approx B }[/math] is defined by: for all C, [math]\displaystyle{ A\succ C \iff B\succ C }[/math] and [math]\displaystyle{ C\succ A \iff C\succ B }[/math] (that is: the lower and upper contour sets of A and B are identical). He proved that, for every partially-ordered space [math]\displaystyle{ (X, \succ) }[/math] that is perfectly-separable, there exists a utility function that is upper-semicontinuous in any topology stronger than the upper order topology.^[7]:{{{1}}} An analogous statement states the existence of a utility function that is lower-semicontinuous in any topology stronger than the lower order topology.

Sondermann^[8] defines a utility function representation similarly to Jaffray. He gives conditions for existence of a utility function representation on a probability space, that is upper semicontinuous or lower semicontinuous in the order topology.

Herden^[9][10] defines a utility function representation of a weak preorder [math]\displaystyle{ \succeq }[/math] as an isotone function^{[clarification needed]} [math]\displaystyle{ u: (X, \succeq) \to (\mathbb{R}, \geq) }[/math] such that [math]\displaystyle{ A \succ B \implies u(A)\gt u(B) }[/math]. Herden^[9]:{{{1}}} proved that a weak preorder [math]\displaystyle{ \succeq }[/math] on X has a continuous utility function, if and only if there exists a countable family E of separable systems on X such that, for all pairs [math]\displaystyle{ A\succ B }[/math], there is a separable system F in E, such that B is contained in all sets in F, and A is not contained in any set in F. He shows that this theorem implies Peleg's representation theorem. In a follow-up paper^[10] he clarifies the relation between this theorem and classical utility representation theorems on complete orders.

Multi-utility representation

A multi-utility representation (MUR) of a relation [math]\displaystyle{ \succeq }[/math] is a set U of utility functions, such that [math]\displaystyle{ A \succeq B \iff \forall u\in U: u(A)\geq u(B) }[/math]. In other words, A is preferred to B if and only if all utility functions in the set U unanimously hold this preference. The concept was introduced by Efe Ok.^[11]

Every preorder (reflexive and transitive relation) has a trivial MUR.^[1]:{{{1}}} Moreover, every preorder with closed upper contour sets has an upper-semicontinuous MUR, and every preorder with closed lower contour sets has a lower-semicontinuous MUR.^[1]:{{{1}}} However, not every preorder with closed upper and lower contour sets has a continuous MUR.^[1]:{{{1}}} Ok and Evren present several conditions on the existence of a continuous MUR:

• [math]\displaystyle{ \succeq }[/math] has a continuous MUR if-and-only-if (X,[math]\displaystyle{ \succeq }[/math]) is a semi-normally-preordered topological space.^[1]:{{{1}}}
• If X is a locally compact and sigma-compact Hausdorff space, and [math]\displaystyle{ \succeq }[/math] is a closed subset of [math]\displaystyle{ X\times X }[/math], then [math]\displaystyle{ \succeq }[/math] has a continuous MUR.^:{{{1}}} This in particular holds if X is a nonempty closed subset of a Euclidean space.
• If X is any topological space, and [math]\displaystyle{ \succeq }[/math] is a preorder with closed upper and lower contour sets, that satisfies strong local non-satiation and an additional property called niceness, then [math]\displaystyle{ \succeq }[/math] has a continuous MUR.^[1]:{{{1}}}

All the representations guaranteed by the above theorems might contain infinitely many utilities, and even uncountably many utilities. In practice, it is often important to have a finite MUR - a MUR with finitely many utilities. Evren and Ok prove there exists a finite MUR where all utilities are upper[lower] semicontinuous for any weak preference relation [math]\displaystyle{ \succeq }[/math] satisfying the following conditions:^[1]:{{{1}}}

1. Reflexive and Transitive (that is, [math]\displaystyle{ \succeq }[/math] is a weak preorder);
2. All upper[lower] contour sets are topologically closed;
3. The space X is second-countable, that is, it has a countable basis.
4. The width of [math]\displaystyle{ \succeq }[/math] (the largest size of a set in which all elements are incomparable) is finite.
   • The number of utility functions in the representation is at most the width of [math]\displaystyle{ \succeq }[/math].

Note that the guaranteed functions are semicontinuous, but not necessarily continuous, even if all upper and lower contour sets are closed.^[11]:{{{1}}} Evren and Ok say that "there does not seem to be a natural way of deriving a continuous finite multi-utility representation theorem, at least, not by using the methods adopted in this paper".

See also

• Von Neumann-Morgenstern utility theorem
• Harsanyi's utilitarian theorem
• Revealed preference theory deals with representing the demand function of an agent by a preference relation, or by a utility function.^[5]

References

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Utility representation theorem. Read more