Imprecise Probabilities — Part I

CoverPage Imprecise Probabilities -- Part I

Introduction

The world is an uncertain place. How to measure and deal with uncertain quantities is an important problem for basically all branches of science, in particular, for measure theory, statistics, data science and finance.

The typical mathematical structure that is used nowadays is a probability space (\Omega, \mathcal{A}, \mathbb{P}). Thereby, the sample space \Omega is a given non-empty set and E_{\mathbb{P}}(X) the (linear) expected value of a random variable X with respect to the probability measure \mathbb{P}.

This mathematical model, however, requires strong assumptions that are quite often not fulfilled in real world. It is rare to find situations in which a probability measure \mathbb{P} fully reflects the corresponding real world situation. In finance, for instance, the normal distribution assumption is heavily used even though it is often not fulfilled.

Data can be scarce and human behavior might also be involved. In these cases, the uncertainty of the probability itself becomes a hard problem and using probability measures might not be sufficient anymore, for instance, due to the Ellsberg Paradox. In the theory of economics, this type of higher level uncertainty is known as Knightian uncertainty.

Example 1.1 (Ellsberg Paradox):
A person is shown two urns, A and B. Each of them containing 10 balls of red or black color. Urn A contains 5 black and 5 red balls while there is no additional information about urn B. That is, all balls in urn B could be black or red or any combination in between.

Fig. 1: Illustration of the two urns A and B each containing 10 balls whereby we do not know the distribution of the color red and black in urn B

One ball is drawn at random from each urn. The person is offered to make a bet on color of the ball chosen from either urn. Winning a bet the person receives, say, 1000 €. Possible bets are, for example, ‘the ball drawn from urn A is black’ denoted by Ab, ‘the ball drawn from urn A is red’ denoted by Ar, and, similarly Bb and Br. Let us assume that the person can pick one option for each of the following four bets:

  1. Bet on Ar, Ab or indifferent;
  2. Bet on Br, Bb or indifferent;
  3. Bet on Ar, Br or indifferent;
  4. Bet on Ab, Bb or indifferent;

We denote the corresponding probabilities of an occurrence of Ar and Ab by p_{Ar} and p_{Ab}, respectively. A similar notation is used for the occurrence of Br and Bb. The probabilities of p_{Ar} and p_{Ab} as well as p_{Br} and p_{Bb} both each add up to 1 given the additivity of the model.

It has been observed empirically that most subjects prefer any bet on urn A to a bet on urn B. The decision that most subjects make with respect to the four bets is usually indifferent for 1. and 2., Ar for 3. and Ab for 4..

From the empirically suggested choice for bet 3. of drawing a red ball in urn B, we infer p_{Br}<p_{Ar}. Similarly, bet 4. implies p_{Bb} < p_{Ab} \Leftrightarrow 1- p_{Br} <  1-p_{Ar} \Leftrightarrow p_{Br} > p_{Ar} and thus a contradiction.

\square

There are several approaches to deal with uncertainty in a proper way, though. One way to deal with uncertainty is to use so-called capacities instead of probability measures \mathbb{P}.

In this post, however, we investigate so-called Imprecise Probabilities. The basic idea is to use a collection of probability measures (e.g. interval or set-valued probabilities), rather than a single (seemingly precise) distribution to model an uncertain event. Imprecise probabilities offer a framework for representing and reasoning about uncertainty in a more flexible and less seemingly precise manner than traditional probability theory.

We are going to focus on the theory put forward by Peter Walley [1]. However, this article is also based on [2] and [3]. Both are well-written and provide a good introduction and an overview on the topic of uncertainty.

Imprecise probabilities recognize that in many real-world situations, it’s difficult to assign precise numerical probabilities to events due to limited information or subjective uncertainty. Instead of a single precise probability value, imprecise probabilities use intervals, sets, or other structures to describe the range of possible probabilities.

We focus on the definition, basic properties and examples in the present Part I.
Part II is based on Part I and studies properties and structures of imprecise probabilities.

Overview

Let us assume that we are uncertain about the outcome of an event, that can be modeled using a set \Omega. The theory of imprecise probabilities is developed in terms of mathematical model (\Omega, \mathcal{X}, \underline{E}), whereby

  • \Omega is a set of possible states of affairs of this event,
  • \mathcal{X}(\Omega)=\mathcal{X} is a class of –i.e. the set of all– gambles on which
  • a real-valued set function \underline{E}: \mathcal{X} \rightarrow \mathbb{R}, called lower prevision, is defined.

The so-called conjugate real-valued set function \overline{E}: \mathcal{X} \rightarrow \mathbb{R}, called upper prevision, can be derived via the relationship \overline{E}(-X)=-\underline{E}(X).
Hence, it is basically sufficient to focus just on lower or upper previsions.

\Omega is the set of possible outcomes, short possibility space, of a well-defined event, experiment, observations, occurrences, or any conceivable facts about the real world. In classical probability theory \Omega is the sample space.

A possibility space \Omega for the event is a finite or infinite set of elementary events \omega\in \Omega, i.e., mutually exclusive outcomes \omega, that is exhaustive in the sense that other outcomes are deemed practically or pragmatically impossible. In classical probability theory, the possibility space \Omega is called sample space.

A gamble X: \Omega \rightarrow \mathbb{R} is a bounded, real-valued function on \Omega, where X(\omega) can be interpreted as an uncertain reward or payoff whose value depends on the uncertain state \omega. In classical probability theory, X is called a random variable. The set of all gambles is denoted by \mathcal{X}.

Rendered by QuickLaTeX.com

A gamble is desirable for us, if we accept ownership of it when offered to us. Either as a bet that we buy or as a bet that we sell. Whether one is willing to accept a gamble depends on one’s belief in the outcome \omega\in \Omega.

We model uncertainty about the event’s outcome (i.e. about the probability distribution of the possibilities) using a set of all desirable gambles \mathcal{D} \subseteq \mathcal{X}. That is, neither a single gamble X nor its function values X(\omega) are uncertain. The uncertainty is reflected in a collection of different gambles instead of just considering one gamble.

Desirability Axioms & Function Vector Spaces

We equip the set of all gambles \mathcal{X}(\Omega) with point-wise addition, point-wise scalar multiplication with real numbers \mathbb{R}, and the supremum norm (topology). Then, \mathcal{X}(\Omega) forms a normed real function vector space V over \mathbb{R}, the bounded function (Banach) space to be precise.

Lower and upper previsions require commitments to act in certain rational ways, which is also reflected in the utility function of the decision-maker in the framework of imprecise probabilities.

As we know, a gamble is desirable for us, if we accept ownership of it when offered to us. We require the rationality criteria (D1) — (D4) as a logical consequence of the theory of upper and lower previsions.

Precise and Linear Subjective Utility Function

The key axiom (D1) and (D2) of the theory is that the utility for the outcome of a gamble is a linear function of the amount of the commodity that the individual gain from it. In other words, the personal utility function for the commodity is precise and linear. These assumptions are key since these requirements directly form a linear function vector space, in which we can model imprecise probabilities.

The theory of upper and lower previsions require commitments to act in certain rational ways. Let us first consider the following two out of four axioms.

(D1) If X is desirable and \lambda>0 then \lambda X is desirable, i.e., X\in \mathcal{D}, \lambda>0 \Rightarrow \lambda X \in \mathcal{D}
(D2) If X and Y are each desirable then X+Y is desirable, i.e., X, Y\in \mathcal{D}, \Rightarrow X+Y \in \mathcal{D}

Recall that the uncertainty about the event’s outcome is reflected in a set of desirable gambles \mathcal{D}. By this, we split the set of all gambles \mathcal{X}(\Omega) into desirable \mathcal{D} and not desirable gambles \mathcal{D}^C. (D1) and (D2), in effect, require that the scale in which rewards X(\omega) \in \mathcal{D} are measured behaves like a linear utility scale and therefore inherits the vector space structure from \mathcal{X}. That is, the criteria of a linear subspace serve as axioms.

(D1) states that if you scale a desirable gamble with a positive real figure, it should still be desirable. So if you are offered a desirable gamble you should also accept each positive multiple of it.

Assume, we have two desirable gambles X, Y\in \mathcal{D}, then X+Y = \{X(\omega)+Y(\omega) | \ \omega\in \Omega\} is also accepted and thus considered desirable, i.e., X+Y\in \mathcal{D} as stated in (D2).

Acccording to (D1) and (D2), a gamble’s desirability should be independent of the stake and the combination of two desirable gambles should also be desirable. In the context of imprecise probabilities, desirability is closely related to the idea of utility or value.

Avoiding Sure Loss and Accepting Sure Gain

The following questions (refer to [3]) are pivotal to the concept of desirability:

  1. Do we need to specify desirability for each gamble individually?
  2. Do we have to consider some specific sets of gambles to be desirable or not desirable?
  3. Can we argue that if some gambles are desirable, then other should be as well, i.e., can we automatically extend a partial specification?

The answer to the last question 3. is obvious given the result from last section about the vector space structure of \mathcal{D}. The linear hull of each D\in \mathcal{D} also has to be desirable. The answer to 1. is therefore ‘no’.

Are there compelling reasons to insist that some gambles should be desirable or not desirable, independent of the information available to us about the event’s outcome?

And indeed there are:

Any gamble that gives a positive payoff or reward without ever giving a negative one needs to be considered desirable in this setting. In addition, any gamble that gives a negative payoff or reward without ever giving a positive one needs to be considered not desirable.

These two criteria can be formalized as follows:

(P1) Accepting partial loss
If X<0 then X\in \mathcal{D} or \mathcal{D} \cap V^-(\Omega) = \emptyset
(P2) Accepting partial gain
If X>0 then X\notin \mathcal{D} or V^+(\Omega)\subseteq \mathcal{D}

Note that X>0 means that for all \omega \in \Omega the function value X(\omega) is always greater than zero. Thereby, 0 can also be interpreted as the zero gamble, where you get 0 for every possibility \omega\in \Omega.

That is, you are certain about the gains and losses and thus certain about the final payoff as sketched in the following graph. No matter which \omega \in \Omega is going to realize, we already know that the outcome will be positive and thus the function value lies in quadrant I. A toy illustration is shown in Fig. 2 below.

Rendered by QuickLaTeX.com

Fig. 2: Sketch of a function vector space with a two-element possibility space \Omega=\{a, b\}. The highlighted quadrants I and III reflect the possible function values X(a) and X(b)

We see that the so-called positive orthant V^+(\Omega) and negative orthant V^-(\Omega) must, respectively, be included in and excluded from the set \mathcal{D}.

In addition, V^+ and V^- is not a vector (sub-)space since the additive inverse is not an element of V^+ and V^-, respectively.

Let us now slightly relax the requirements made in (P1) and (P2) and assume you are offered a gamble, where you are either guaranteed to

  • experience a loss regardless of the decision you made, i.e.,
    \inf(X)>0 \Rightarrow X \in \mathcal{D} or \text{int}(V^+(\Omega)) \subset \mathcal{D}
  • experience a gain regardless of the decision you made, i.e.,
    \sup(X)<0 \Rightarrow X \notin \mathcal{D} or \text{int}(V^-(\Omega)) \cap \mathcal{D} = \emptyset.

Note that \text{int}(\cdot) is the interior of a set.

This effectively means that there is no uncertainty about the fact that the decision will result in either a loss or a gain. The theory of lower and upper previsions requires that such gambles where you are sure about a loss are not considered to be desirable. Likewise, gambles where you are sure about a gain are considered to be desirable. Let us formalize these rationality criteria according to the theory of lower and upper previsions in the following axioms.

(D3) Avoiding sure loss
If \sup(X)<0 then X is not desirable.
(D4) Accepting sure gain
If \inf(X)>0 then X is desirable.

Lower and Upper Previsions

The theory of imprecise probabilities consider gambles, whose possible outcomes are gains or losses of a single commodity.

Lower and upper previsions generalize probabilities and expectations we usually encounter in the classical probability theory, though this theory falls squarely within the subjective approach of probability.

Subjective means in this context behavioral, that is, a subject’s probability (i.e. belief) for an event reflects his willingness to take certain actions whose outcome depends on its occurrence, such as accepting bets on or bets against the event at certain betting rates.

The outcome of a gamble X is uncertain and depends on the events \omega\in \Omega of interest as well as on the utility function of the individual decision-maker. Recall that a gamble X:\Omega \rightarrow \mathbb{R} is a bounded real-valued map on the possibility space. It represents an uncertain reward, whose value is X(\omega) if the outcome of the experiment is \omega\in \Omega. This reward is expressed in units of some linear utility scale as outlined in the section before.

The theory of lower previsions considers two types of transactions involving a gamble X:

  • Accepting to buy X for a price \mu>0, which comes down to accepting the gamble X-\mu
  • Accepting to sell X for a price \lambda>0, which comes down to accepting the gamble - X+\lambda

Note that \lambda>0 is the buying or ask price that we receive as a seller while \mu>0 is the selling or bid price we need to pay as a buyer. Inflows and outflows relative to a certain party are represented by positive and negative signs, respectively.

Let us now assume that a bet X has been accepted by both parties of the deal, i.e. by the seller and the buyer. This implies that a price \nu=\mu=\lambda>0 is acceptable for both, i.e., the corresponding bid-ask spread is zero. Figure 3 illustrates the payoffs for both parties in this case. Note that X(\omega) can be positive and negative.

Rendered by QuickLaTeX.com

Fig. 3: Exchange of cash flows to the buyer and seller. The payoff of the gamble X depends on the event \omega\in \Omega that realizes and might be positive or negative for the buyer. That is, the outcome of X is uncertain


We denote \inf(X):= \inf\{X(\omega) | \ \omega\in \Omega \} for the infimum (greatest lower bound) and \sup(X):= \sup\{X(\omega) | \ \omega\in \Omega \} for the supremum (least upper bound). Both \inf(X) as well as \sup(X) are finite since a gamble is bounded by definition. We write X\geq Y if X(\omega) \geq Y(\omega) for all \omega\in \Omega.


A subject’s lower prevision \underline{E}(X) for a gamble X represents his supremum acceptable buying or ask price for X, which is the highest price s such that the subject accepts to buy X for all prices \mu<s. In other words

(1)   \begin{align*}  \underline{E}(X) = s := \sup \{ \mu \in \mathbb{R} | \ X-\mu\in \mathcal{D} \},  \end{align*}

where \mathcal{D} is the set of gambles that our subject finds desirable. (1) implies that the subject is willing to pay \underline{E}(X)-\epsilon for the uncertain reward X, or in other words, that the transaction X-\underline{E}(X)+\epsilon is desirable for the subject for every \epsilon >0. Nothing is said about whether the subject would actually buy the gamble X for the price \underline{E}(X) given the definition of the supremum.

We can also consider our subject’s upper prevision, or infimum acceptable selling or bid price, for the gamble X, which we denote by \overline{E}(X). It is the lowest price t such that the subject accepts to sell X for all prices \lambda>t. In other words

(2)   \begin{align*} \overline{E}(X) = t:= \inf \{ \lambda \in \mathbb{R} | \ -X+\lambda \in \mathcal{D} \}. \end{align*}

(2) implies that the subject is willing to sell the gamble X for \overline{E}(X)+\epsilon. That is, the transaction -X+\overline{E}(X)+\epsilon is desirable for the subject for every \epsilon >0. Again, nothing is said about the price \overline{E}(X) itself.

Rendered by QuickLaTeX.com

Fig. 5: Illustration of upper and lower prevision of a buyer and a seller

The following Fig. 6 illustrates the general interrelation between the lower and upper prevision focused on the payoff function compared to the situation as shown in Fig. 5.

Rendered by QuickLaTeX.com

Fig. 6: Interrelation between the lower and upper prevision in the general case, i.e. when the lower prevision does not necessarily meet the upper prevision.

Note that a fair (market) price exists if lower and upper prevision meet. In this case no ‘undecided’ interval exists.

Let us apply the theory in the next example.

Example 4.1 (Urn, modified version taken from [1]):
Suppose a ball is drawn from an urn with red, white and black balls. We are offered a reward depending on the color of the ball:

  • We get €10 if red ball is drawn,
  • we get €5 if a white ball is drawn, and
  • we get €0 if a black ball is drawn.

The corresponding gamble X is based on the possibility space \Omega:=\{b, r, w\}, where b, r and w stands for ‘black’, ‘red’ and ‘white’, respectively. That is, X is defined by

    \begin{align*} X(r)&=10 \\ X(w)&=5 \\ X(b)&=0 \end{align*}

The bet X is desirable since all payoffs are not negative. In addition, we might be willing to pay some fixed amount of money, say x €, in order to buy the gamble and thus to receive the uncertain reward. We are going to suppress the € symbol in the rest of this example.

The increase in wealth for the buyer would be X(\omega) - x. That is, 10-x if a red ball is drawn, 5-x if a white ball is drawn, and 0-x=-x if a black ball is drawn.

The supremum amount of money x, we are willing to pay to buy the gamble, will be our lower prevision \underline{E}(X) for the gamble X.

If, for instance, we are absolutely certain that there is no black ball in the urn, we should be disposed to pay up to 5 since this is the least we will get given the subject’s belief. In other words, the wealth will not be decreased no matter what event –i.e. a red or a white ball is drawn– will arise. Hence, the subject will assume some sort of worst case given its belief.
If, for instance, the subject is sure that only red balls are in the urn, then we the buyer should pay less than 10 since +10 is the worst payoff the buyer can have given his belief.

On the other hand, we could also consider selling the gamble X for a fixed price y. Our increase in wealth will then be y-10 if the red ball is drawn, y-5 if the white ball is drawn, and y if the black ball is drawn. The infimum amount of money y, that we require in order to sell X, will be his upper prevision \overline{E}(X).

If, for instance, the seller is absolutely certain that there are only red and white balls in the urn, he should accept to sell for any price >10. Apparently, -10 is the worst payoff the seller can have in the gamble under this condition.

\square

The last example demonstrated that the price, that a rational buyer is willing to pay and a rational seller is willing to sell for this gamble, respectively, depends on the presumed distribution of the white, red and black balls in the urn.

If we generalize that observation, we can see that the prize of a gamble directly depends on probabilities assigned to the possibilities \omega\in \Omega.

If \underline{E} on \mathcal{X} with possibility set \Omega is a lower prevision, the conjugate upper prevision \overline{E} is defined on the domain -\mathcal{X}:=\{ -X: \ X\in \mathcal{X} \} by \overline{E}(-X):= -\underline{E}(X). A benefit under a lower is going to be a loss under an upper prevision. Note that \overline{E} may be defined on a different domain from \underline{E}.

In the theory of lower and upper previsions, we are not paying attention to the subject’s entire set of desirable gambles \mathcal{D} but rather try to model our subject’s belief by looking directly at this lower and upper previsions for a number of gambles.

Recall that we model uncertainty about an event’s outcome (i.e. about the probability distribution of the possibilities) using a set of all desirable gambles of a subject. Suppose our subject assesses lower previsions \underline{E}(X) for all gambles X on some subset \mathcal{D} \subset \mathcal{X}. This defines a real functional \underline{E}: \mathcal{D} \rightarrow \mathbb{R}, which is the lower prevision with domain \mathcal{D}. There is an analog definition for the upper prevision with domain \mathcal{D}'.

Since selling a gamble X for a price \nu is the same thing as buying the gamble -X for the price -\nu, buyer and seller need to be disposed to accept these transactions under the same conditions. Hence, the seller’s infimum acceptable selling price need to agree with the buyer’s supremum acceptable buying price for X. Again, in this case the bid-ask-spread is zero, i.e. \lambda=\mu=\nu as illustrated in Fig. 4:

    \begin{align*} \underline{E}(X)  &= \inf\{\lambda \in \mathbb{R}: \ \lambda - X \in \mathcal{D} \}\\ &= \inf\{\lambda \in \mathbb{R}: \ -(-\lambda) - X \in \mathcal{D} \}\\ &= \inf\{-\mu \in \mathbb{R}: \ -(\mu) - X \in \mathcal{D} \}\\ &= -\sup\{\mu \in \mathbb{R}: \ -\mu - X \in \mathcal{D} \}\\ &= -\underline{E}(-X). \end{align*}

As a consequence, given the lower prevision \underline{E} on a set of gambles \mathcal{D}, we can define the so-called conjugate upper prevision \overline{E} on -\mathcal{D}:=\{ -X | \ X\in \mathcal{D} \}, by \overline{E}(-X):=-\underline{E}(X), and vice versa. Taking this into account, as we can freely go from one concept to the other, it suffices to discuss only one of them.

Without loss of generality, we are going to focus on lower previsions or to put it differently on the buying side.

Coherent Sets of Desirable Gambles

The axioms (D1) – (D4) are fundamental for the theory of imprecise probabilities. The first two axioms (D1) and (D2) basically require that the set \mathcal{D}, that contains all desirable gambles, is a (function) vector space.

What about (D3) and (D4)?

Let us consider axiom (D3) closer. Let \mu>0 be the buying price for the gamble X. If \sup_{\omega\in \Omega}{X(\omega) - \mu} is negative no matter what outcome \omega\in \Omega is going to be, then X needs to be a non-desirable gamble.

Hence, from a buyer perspective a desirable gamble needs to fulfill the condition

(3)   \begin{align*} \sup_{\omega\in \Omega}\{ X(\omega) - \underline{E}( X(\omega))  \} > 0 \end{align*}

If \underline{E}( X(\omega)) > X(\omega) for all \omega\in \Omega, then it’s going to be a sure overall loss for the buyer. This needs to be avoided according to axiom (D3), such that the difference of both need to be positive for some \omega \in \Omega.

The in-equation (3) requires that the overall payoff X(\omega)-\underline{E}( X(\omega)) is at least of positive utility for some \omega\in \Omega. Hence, it is sufficient in (3) to check the best case(s), i.e. to take the supremum over \omega\in \Omega.

If we apply the additivity axiom (D2) to a finite set of desirable gambles X_i with i\in \{1, \ldots, n \} and n \in \mathbb{N}, it follows that

(4)   \begin{align*}  \sup_{\omega\in \Omega}\ \{ \sum_{i=1}^{n} \left[ X(\omega) - \underline{E}( X(\omega) ) \right] \} \ \geq 0. \end{align*}

To motivate condition (4), assume that it is not satisfied. Then there are n\in \mathbb{N}, X_1, \ldots, X_n in \mathcal{X}, and \epsilon>0 such that

    \begin{align*} \sum_{i=1}^{n}{ \left[ X_i - \underline{E}(X_i) +\epsilon \right]  } \leq -\epsilon, \end{align*}

meaning that the sum of the desirable gambles X_i(\omega) -\underline{E}(X_i(\omega))+\epsilon results in a loss of at least \epsilon, no matter the outcome of the event \omega\in \Omega. Since the sum needs to be desirable by (D3), this violates (D1). Contradiction.

\square

Let us try to illustrate that in an example.

Example 5.1 (Urn continued)
A subject is faced with the bet X as outlined in Example 4.1:

    \begin{align*} X(r)&=10 \\ X(w)&=5 \\ X(b)&=0 \\ \end{align*}

The subject is absolutely certain that there is no black ball in the urn, such that he is disposed to pay up to 5 since this is the least he will get given his belief. Therefore, he is avoiding a sure loss for the gamble X based on his belief.

Another gamble Y, defined by

    \begin{align*} Y(r)&=0 \\ Y(w)&=5 \\ Y(b)&=9 \end{align*}

, is also offered to this subject. Let us assume the subject is willing to pay 6 for the bet Y, then the overall payoff for both bets is determined by

    \begin{align*} (X+Y)(r)&=10+0=10 \\ (X+Y)(w)&=5+5=10 \\ (X+Y)(b)&=0+9=9  \end{align*}

Realize that the subject needs to invest \nu=5+6=11 to buy both bets X and Y. This means that the infimum acceptable buying price \nu=\underline{E}(X+Y) is always higher than in any outcome \omega\in \Omega. It is therefore certain to loose no matter what event is going to materialize, i.e. a sure loss.

Hence, given axiom (D3) the subject must not accept a buying price of 6 for the bet Y. In addition, the subject is sure that there is no black ball in the urn. Given its belief, the buyer gets its lowest reward of 0 under Y if a red ball is drawn.

Let us assume that our subject is willing to pay 4 for the bet Y after some reflection.
In this case the overall payoff including the buying price \nu=5+4 is as follows:

    \begin{align*} (X+Y)(r) - \nu &= 10+0-9 = 1 \\ (X+Y)(w) - \nu &= 5+5-9 = 1 \\ (X+Y)(b) - \nu &= 0+9-9 = 0 \end{align*}

Paying 4 for Y will avoids a sure loss. Let us wrap it up considering the subjects point of view. The supremum acceptable buying price \overline{E}(X) equals 5 and the supremum acceptable buying price \overline{E}(Y) is 4.

\square

There is a stronger rationality condition called coherence.
It requires that our subject’s supremum acceptable buying price for a gamble X cannot be raised by considering a positive linear combination of a finite number m of other acceptable gambles. That is,

(5)   \begin{align*} \sup_{\omega\in \Omega} \{ &  \sum_{i=1}^{n}{ \left[ X_i - \underline{E}(X_i) +\epsilon \right]  } \\  &-m[X_0-\underline{E}(X_0) +\epsilon] \} \geq 0, \end{align*}

for all natural m, n\geq 0 and all X_0, X_1, \ldots, X_n \in \mathcal{X}. A lower prevision satisfying the condition (5) will particular avoid sure loss — just consider the case m=0 along with condition (4). In addition, note that the gambles in (5) obviously depend on the realization \omega\in \Omega.

Let us show that coherence is consistent with the desirability axioms. Suppose that equation (5) does not hold for some non-negative integers n, m and some X_0, X_1, \ldots, X_n in \mathcal{X}. If m=0, this means that \underline{E} incurs a sure loss, which we have already argued is an inconsistency. Assume therefore that m>0, then there is a \epsilon>0 such that

    \begin{align*} \sum_{i=1}^{n}&{ \left[ X_i - \underline{E}(X_i) +\epsilon \right]  } \ \leq \\  & m[X_0-(\underline{E}(X_0)+\epsilon)]. \end{align*}

The left-hand side is a sum of desirable transactions, and should therefore be desirable, by axiom (D2). The dominating right-hand side should be desirable as well since it offers an even higher overall payoff. This, however, means that our subject should accept to buy the gamble X_0 for the price \underline{E}(X_0)+\epsilon, which is strictly higher than the supremum buying price he has specified for it. This is again an inconsistency that, is ruled out by the coherence condition.

Further Examples

In the last five chapters, we have studied the definition and basic properties of imprecise probabilities and used urn examples to illustrate these. In this chapter, we are going to look at other example types including those examples that are also used in classical probability theory such as rolling dices and flipping coins.

Most people and most examples in classical probability theory assume that all outcomes of flipping a coin are equally likely. The € coin has been accused of not being fair, i.e., that heads is more likely than tails landing face upwards.

Example 6.1 (Flipping a €-Coin)
A subject’s belief is that a German €-coin lands more often on heads than on tails, i.e. that the probability of landing head upwards is in (0.51, 0,55). Correspondingly, the likelihood of landing tails upwards lies between 45\% and 49\%.

What supremum buying price is the subject willing to pay therefore for carrying out 1,000 of the following bet X?

    \begin{align*} \omega \mapsto X(\omega):= \begin{cases}                              +1 € & \text{if } \omega \in \text{{heads}}\\                              -1 € & \text{if } \omega \in \text{{tails}},                            \end{cases} \end{align*}

If the coin is fair, the expected value of a series of 1,000 of these bets is zero. Given the subject’s belief, the supremum buying price is €20 = (0.51-0.49)\cdot € 1,000.

The subject would not accept to sell this bet since according to his belief, he can only make a loss between €20 and €50. Otherwise, this would contradict axiom (D3) of avoiding a sure loss.

\square

The possibility space \Omega:=\{1,2,3,4,5,6\} of a six-sided dice is just as in the classical case with \mathcal{X} = 2^\Omega. When it comes to rolling a six-sided dice, most of us assume that each number from 1 to 6 has a chance of \frac{1}{6} of landing face up. But this holds only true if the dice is a perfectly balanced cube. So what if our trusty dice is not as precise as we think?

Example 6.2 (Rolling Dice)
A subject’s belief is that a certain die might not be perfectly balanced, i.e., that even numbers show up more often than odd numbers. This belief might be based on some empirical observations that the odd numbers are less likely to show face upwards. Hence, it is more desirable for the subject to bet on the occurrence of even numbers.

That is, the subject beliefs that the probability of the event \{2,4,6\} lies somewhere between 50\% and 52\%. Since the rolling dices are independent events, the corresponding probability of \{1,3,5\} is believed to lie somewhere between 48\% and 50\%.

What supremum buying price is the subject willing to pay therefore for carrying out 1,000 of the following bet X?

    \begin{align*} \omega \mapsto X(\omega):= \begin{cases}                              +1 € & \text{if } \omega \in \{2,4,6\}\\                               0 € & \text{if } \omega \in \{1,3,5\},                            \end{cases} \end{align*}

If the subject thinks that the actual probability of the event \{2,4,6\} is in (0.50, 0.52), the expected payoff of 1,000 bets X lies between € 500 and € 520. Provided that his belief turns out to be true, the worst expected payoff would lie above €500. This in return, is the supremum buying price \underline{E}(1000\cdot X)=500 of the subject for this series of bets. That is, the subject should not pay more than € 500 to buy this series of bets.

Applying the concept of imprecise probabilities, we can reflect the subject’s uncertainty by the intervals (0,50, 0.52) for the likelihood of landing heads upwards.

The corresponding upper prevision \overline{E} of the series of bets is 520. This represents the infimum selling price of the series of 1,000 bets X. Given our belief the worst scenario that can happen is that we need to pay € 520, which in return means that this is the infimum selling price of that series of bets.

\square

Our last example delves into the realm of a market maker [6], a trader who provides quotes to other market participants at which he stands ready to buy and sell a given asset. A market maker

  • makes money out of buying low and selling high (bid-ask spread) while facing the risk that the price moves adversely without him being able to unwind his position rapidly enough;
  • must be able to adapt quickly to changing market conditions;
  • is exposed to the risk that the price moves against them, in particular, in a volatile market.

A market maker faces a constant trade-off between several competing objectives. A typical trade-off is, for instance, to either choose a high-margin and low-volume versus low-margin and high-volume market. There are, however, many other connected objectives such as being compliant, having a low inventory of the traded assets and to keep an overall low level of risk.

In a broad sense, a market maker is therefore a liquidity supplier, who faces a hard optimization problem that has been addressed in a long list of academic papers. Most mathematical models assume an arithmetic Brownian motion of the asset set in a classical probability space.

Instead of using classical probability spaces and stochastic processes such as a Brownian motion with exact probabilities to model bid and ask quotes, we can employ the theory of imprecise probabilities. There are several ways to do so and it ultimately depends on the subject’s belief and objectives.

Example 6.3 (Quotes Allianz SE stock)
The market maker of Allianz SE stock is uncertain about the price development. The last available price is €240 from yesterday. Because of some recent events, he expects that the next market price of the stock should lie somewhere in [241, 242].

Rendered by QuickLaTeX.com

This situation can be modeled using the discrete possibility space \Omega considering the ticks, i.e., the smallest unit by which the price of an asset can change. The market maker has an inventory of the Allianz SE stock bought at an price of €240. The gamble can therefore be modeled by the function

    \begin{align*} \omega \mapsto X(\omega):= (\omega - 240). \end{align*}

The market maker will only gain, if the stock price is greater than € 240. His lower and upper prevision is 241 and 242, respectively.

The bid price is the highest price a buyer / bidder is willing to pay. Correspondingly, the ask price is the lowest price a seller is willing to accept. These definitions suit the definition of a lower and upper prevision obviously.

However, it would also be possible to employ the theory of imprecise probabilities on the bid and ask price separately. That is, to model the uncertainty around the bid price, for instance, separately.

\square

Literature

The Standford Encyclopedia of Philosophy contains a good introduction to the theory of Imprecise Probabilities.

[1]

Walley, P. (1991) Statistical reasoning with imprecise probabilities. 1st ed. London ; New York: Chapman and Hall (Monographs on statistics and applied probability, 42).

[2]
Cuzzolin, F. (2021) The geometry of uncertainty: the geometry of imprecise probabilities. Cham: Springer.

[3]
Augustin, T. (ed.) (2014) Introduction to imprecise probabilities. Chichester, West Sussex: John Wiley & Sons Inc (Wiley series in probability and statistics).

[4]
Farenick, D. (2016) Fundamentals of functional analysis. New York, NY: Springer Science+Business Media.

[5] Conditional Probabilities and the Bayes Theorem by Alexander von Felbert
[6] Mathematical modeling for market making and related problems of financial liquidity: a song of assets and traders by Philippe Bergault