 # Inference with Choice Functions Made Practical

We study how to infer new choices from previous choices in a conservative manner. To make such inferences, we use the theory of choice functions: a unifying mathematical framework for conservative decision making that allows one to impose axioms directly on the represented decisions. We here adopt the coherence axioms of De Bock and De Cooman (2019). We show how to naturally extend any given choice assessment to such a coherent choice function, whenever possible, and use this natural extension to make new choices. We present a practical algorithm to compute this natural extension and provide several methods that can be used to improve its scalability.

## Authors

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## 1 Introduction

In classical probability theory, decisions are typically made by maximizing expected utility. This leads to a single optimal decision, or a set of optimal decisions all of which are equivalent. In imprecise probability theory, where probabilities are only partially specified, this decision rule can be generalized in multiple ways; Troffaes

 provides a nice overview. A typical feature of the resulting imprecise decision rules is that they will not always yield a single optimal decision, as a decision that is optimal in one probability model may for example be sub-optimal in another.

We will not focus on one particular imprecise decision rule though. Instead, we will adopt the theory of choice functions: a mathematical framework for decision making that incorporates several (imprecise) decision rules as special cases, including the classical approach of maximizing expected utility [3, 2, 6]. An important feature of this framework of choice functions is that it allows one to impose axioms directly on the decisions that are represented by such a choice function [2, 6, 9]. We here adopt the coherence axioms that were put forward by De Bock and De Cooman .

As we will explain and demonstrate in this contribution, these coherence axioms can be used to infer new choices from previous choices. For any given assessment of previous choices that is compatible with coherence, we will achieve this by introducing the so-called natural extension of this assessment: the unique most conservative coherent choice function that is compatible with the assessment.

We start in Section 2 with an introduction to choice functions and coherence and then go on to define the natural extension of choice assessments in Section 3. From then on, we work towards a method to compute this natural extension. An important step towards this goal consists in translating our problem to the setting of sets of desirable option sets; we do this in Section 4. In this setting, as we show in Section 5, the problem takes on a more manageable form, leading to a practical algorithm that we present in Section 7. The complexity of this algorithm depends rather heavily on the size of the assessment that is provided though. To address this issue, Section 6 presents several methods that can be used to replace an assessment by an equivalent yet smaller one. Section 8 concludes the paper and provides some suggestions for future work.

## 2 Choice functions

A choice function is a function that, when applied to a set of options, chooses one or more options from that set. Usually the options are actions that have a corresponding reward. This reward furthermore depends on the state of an unknown—uncertain—variable that takes values in a set . We will assume that the rewards can be represented by real numbers, on a real-valued utility scale. In this setting, an option is thus a function from states in to . We will denote the set of all possible options by . Evidently,

is a vector space with vector addition

and scalar multiplication for all , and . Moreover, we endow with the partial order defined by for all and a corresponding strict version , where if both and .111Our results in section 2 and 3 also work for any ordered vector space over the real numbers; we restrict ourselves to the particular order for didactic purposes. To make this more tangible, we consider the following toy problem as a running example.

###### Example 1

1.   A farming company cultivates tomatoes and they have obtained a large order from a foreign client. However, due to government regulations they are not sure whether they can deliver this order. So, the state space is order can be delivered, order cannot be delivered. The company now has multiple options to distribute their workforce. They can fully prepare the order, partially prepare the order or not prepare the order at all. Since only has two elements, we can identify the options with vectors in . We will let the first component of these vectors correspond to the reward if the order can be delivered. For example, the option of fully preparing the order could correspond to the vector . If the order goes through, then the company receives a payment—or utility—of for that order. However, if the order does not go through, the company “receives” a negative reward , reflecting the large amount of resources that they spent on an order that could not be delivered in the end.

We will restrict ourselves to choices from finite sets of options. That is, the domain of our choice functions will be : the set of all finite subsets of , including the empty set. Formally, a choice function is then any function such that for all . We will also consider the corresponding rejection function .

###### Example 1

2.   We will let the choice function correspond to choices that the strategic advisor of the company makes or would make for a given set of options, where these choices can be multi-valued whenever he does not choose a single option. Suppose for example that he has rejected and from a set , with and but remains undecided about whether to choose or . This corresponds to the statement , or equivalently, .

We will give the following interpretation to these choice functions. For every set and option , we take is chosen—to mean that there is no other option in that is preferred to . Equivalently, is rejected from —if there is an option in that is preferred to . The preferences in this interpretation are furthermore taken to correspond to a strict partial vector order on that extends the original strict order . This implies that it should have the following properties: for all and ,

 O1.u⊀v or v⊀u, (antisymmetry) O2.if u≺v and v≺w then also u≺w, (transitivity) O3.if u≺v then also u+w≺v+w, (translation invariance) O4.if u≺v then also λu≺λv. (scaling invariance)

Crucially, however, the strict partial order need not be known. Instead, in its full generality, our interpretation allows for the use of a set of strict partial orders, only one of which is the true order . As shown in reference , this interpretation can be completely characterized using five axioms for choice functions. Rather than simply state them, we will motivate them one by one starting form our interpretation.

The first axiom states that we should always choose at least one option, unless we are choosing from the empty set:

 C0.C(A)≠∅ for all A∈Q∖{∅}.

This follows directly from our interpretation. Indeed, if every option in would be rejected, then for every option in , there would be some other option in that is preferred to . Transitivity would then imply that contains an option that is preferred to itself, contradicting antisymmetry . To understand the second axiom, first observe that it follows from translation invariance that if and only if . So if we let , then it follows from our interpretation that is chosen from if and only if is chosen from :

 C1.u∈C(A)⇔0∈C(A−u) % for all A∈Q and u∈A.

An important consequence of this axiom, is that knowing from which sets zero is chosen suffices to know the whole choice function. To formalize this, we introduce for any choice function a corresponding set of option sets

 KC\coloneqq{A∈Q:0∉C(A∪{0})}. (1)

For any option set , it follows from our interpretation for that contains at least one option that is preferred to zero. Or equivalently, since zero is not preferred to itself because of , that contains at least one option that is preferred to zero. We call such an option set a desirable option set and will therefore refer to as the set of desirable option sets that corresponds to . Since it follows from that

 (∀A∈Q)(∀u∈A)u∉C(A)⇔A−u∈KC, (2)

We see that the set of desirable option sets fully characterizes the choice function . Whenever convenient, we can therefore express axioms for in terms of as well. The next axiom is a first example where this is convenient. Since the preference order  is taken to extend the order , it follows that we must prefer all elements of to zero. Hence, is a desirable option set for all :

 C2.{u}∈KC for all u∈V>0.

Or to state it in yet another way: the set of positive singletons should be a subset of .

Another axiom that is easier to state in terms of follows from the fact that we can take positive linear combinations of preferences. For example, if we have two non-negative real numbers and they are not both zero, and we know that and , then it follows from and that also . To state this more compactly, we let222We will denote tuples in boldface and their elements roman with a positive integer index corresponding to their position.

 Rn,+\coloneqq{λ∈Rn:(∀j∈{1,…,n})(λj⩾0),∑nj=1λj>0}

for any positive integer and introduce a product operation for tuples with tuples of vectors . Then for any and any such that and , we have that . Consider now two sets . Then as we explained after Equation 1, each of them contains at least one option that is preferred to zero. Hence, by the reasoning above, there will be at least one pair of options in for which and and thus for . Thus, the set of all such possible combinations—where can depend on —will contain at least one option preferred to zero en must therefore belong to :

 C3.{λ(u)u:u∈A×B}∈KC for all λ:A×B→R2,+ and A,B∈KC.

The final axiom states that if an option is rejected from an option set , then it will also be rejected from any superset :

 C4.A⊆B⇒RC(A)⊆RC(B) for all A,B∈Q.

Once more, this follows from our interpretation for . If is rejected from , then this means that there is an element that is preferred to . Since and also belong to , it thus follows that is rejected from as well. This axiom is also known as Sen’s condition .

###### Definition 1

We call a choice function coherent if it satisfies axioms . The set of all coherent choice functions is denoted by .

A crucial point is that the axioms are the same as the axioms in , but tailored to our notation and in a different order; corresponds to whereas corresponds to . Interestingly, as proven in reference , the axioms are therefore not only necessary for a choice function to correspond to a set of strict partial orders, but sufficient as well.

## 3 Natural extension

Fully specifying a coherent choice function is hard to do in practice, because this would amount to specifying a set-valued choice for every finite set of options, while at the same time taking into account the coherence axioms. Instead, a user will typically only be able to specify —or —for option sets in some small—and often finite—subset of . For all other option sets , we can then set because this adds no information to the choice function assessment. The resulting choice function may not be coherent though. To make this more concrete, let us go back to the example.

###### Example 1

3.   Suppose that the strategic advisor of the farming company has previously rejected the options and from the option set , as in Example 1.2, and has chosen from , where and This corresponds to the choice function assessments Suppose now that the company’s strategic advisor has fallen ill and the company is faced with a new decision problem that amounts to choosing from the set . Since no such choice was made before, the conservative option is to make the completely uninformative statement . However, perhaps the company can make a more informative choice by taking into account the advisor’s previous choices?

In order to make new choices based on choices that have already been specified—as in the last question of the example—we can make use of coherence. Indeed, all the coherence axioms except allow one to infer new choices—or rejections—from other ones. In this way, we obtain a new choice function that is more informative than in the sense that for all . Any such choice function that is more informative than , we call an extension of . In order to adhere to the coherence axioms, we are looking for an extension of that is coherent. We denote the set of all such extensions by .

Whenever at least one such coherent extension exists, we call consistent. The least informative such coherent extension of is then called its natural extension, as it is the only coherent extension of that follows solely from and the coherence axioms, without adding any additional unwarranted information. In order to formalize this notion, we let

 CC\coloneqq{C′∈C:C′(A)⊆C(A) for all A∈Q}

and let be defined by

 Ex(C)(A)\coloneqq⋃C′∈CCC′(A) for all A∈Q,

where, by convention, the union over an empty set is taken to be empty itself.

###### Definition 2

For any choice function , we call consistent if and then refer to as the natural extension of .

###### Theorem 3.1

For any choice function that is consistent, is the least informative coherent extension of . That is, and, for all , we have that for all . If on the other hand is not consistent, then is incoherent and for all .

Given a choice function that summarizes earlier choices and a new decision problem that consists in choosing from some set of options , we now have a principled method to make this choice, using only coherence and the information present in . First we should check if is consistent. If it is not, then our earlier choices are not compatible with coherence, and would therefore better be reconsidered. If is consistent, then the sensible choices to make are the options in , since the other options in can safely be rejected taking into account coherence and the information in . If contains only one option, we arrive at a unique optimal choice. If not, then adding additional information is needed in order to be able to reject more options. The problem with this approach, however, is that it requires us to check consistency and evaluate . The rest of this contribution is devoted to the development of practical methods for doing so. We start by translating these problems to the language of sets of desirable option sets.

## 4 Sets of Desirable Option Sets

As explained in Section 2, every coherent choice function is completely determined by its corresponding set of desirable option sets . Conversely, with any set of desirable option sets , we can associate a choice function , defined by

 CK(A)\coloneqq{u∈A:(A−u)∖{0}∉K} for all A∈Q. (3)

In order for to be coherent, it suffices for to be coherent in the following sense.

###### Definition 3

A set of desirable option sets is called coherent  if for all :

 K0.A∖{0}∈K; K1.{0}∉K; K2.Vs>0⊆K; K3.{λ(u)u:u∈A×B}⊆K for all λ:A×B→R2,+; K4.A∪Q∈K for all Q∈Q.

We denote the set of all coherent by .

###### Proposition 1

If a set of desirable option sets is coherent, then is coherent too.

###### Proposition 2

If a choice function is coherent, then is coherent too.

###### Theorem 4.1

The map is a bijection and has inverse for all .

In other words: every coherent choice function corresponds uniquely to a coherent set of desirable option sets , and vice versa.

The plan is now to use this connection to transform the problem of computing the natural extension of a choice function to a similar problem for sets of desirable option sets. We start by transforming the choice function into a set of option sets. One way to do this would be to consider the set of desirable option sets . However, there is also a smarter way to approach this that yields a more compact representation of the information in .

###### Definition 4

An assessment is any subset of . We denote the set of all assessments, the power set of , by . In particular, with any choice function , we associate the assessment

 AC\coloneqq{C(A)−u:u∈RC(A),A∈Q}.
###### Example 1

4.   In our running example, the assessment that corresponds to is , with , and where and similarly , and .

An assessment such as may not be coherent though. To extend it to a coherent set of desirable option sets, we will use the notions of consistency and natural extension that were developed for sets of desirable option sets by De Bock and De Cooman . To that end, for any assessment , we consider the set of all coherent sets of desirable option sets that contain and let

 Ex(A)\coloneqq⋂¯K(A), (4)

where we use the convention that .

###### Definition 5

For any assessment , we say that is consistent if and we then call the natural extension of [1, definition 9].

As proven by De Bock and De Cooman , the consistency of implies the coherence of . Our next result establishes that the converse is true as well.

###### Theorem 4.2

For any assessment the following are equivalent:

1. is consistent;

2. is coherent;

3. .

The connection with choice functions is established by the following result.

###### Theorem 4.3

Let be a choice function. Then is consistent if and only if , and if it is, then

By this theorem, we see that checking consistency and computing the natural extension of a choice function amounts to being able to check for any option set whether it belongs to or not. Indeed, given some choice function , we can check its consistency by checking if and, taking into account Equation 3, we can calculate for a given set , by checking for any element if .

## 5 Natural extension and consistency for finite assessments

In practice, we will typically be interested in computing the natural extension of choice functions that are finitely generated, in the sense that for only finitely many option sets . In that case, if we let , then

 AC={C(A)−u:u∉C(A),A∈Q}={C(A)−u:u∉C(A),A∈OC}.

Since is finite and every is finite because is, it then follows that is finite as well. Without loss of generality, for finitely generated choice functions , will therefore be of the form , with . The list of option sets may contain duplicates in practice, for example if different and yield the same option set . It is better to remove these duplicates, but our results will not require this. The only thing that we will assume is .

The following theorem is the main result that will allow us to check in practice whether an option set belongs to or not.

###### Theorem 5.1

Let , with and . An option set then belongs to if and only if either or, and, for every , there is some and for which .

In combination with Theorem 4.3, this result enables us to check the consistency and compute the natural extension of finitely generated choice functions. Checking consistency is equivalent to checking if .

###### Example 1

5.   We will now go ahead and test if the strategic advisor was at least consistent in his choices. Since , we have to check the second condition in Theorem 5.1. In particular, we have to check if, for every tuple , there is some such that . We will show that this is not the case for the particular tuple . Assume that there is some such that Notice that , so if we let and then

 λu⩾25λ1w4+λ2w4+λ3w5=μ1w2+17μ2w5=(5μ1−μ2,−3μ1+μ2).

Since , this implies that and thus and . This is impossible though because implies that or . Hence, , so is consistent. We conclude that the decisions of the strategic advisor were consistent, enabling us to use natural extension to study their consequences.

If a finitely generated choice function is consistent, then for any option set , we can evaluate by checking for every individual if . As we know from Equations 3 and 4.3, this will be the case if and only if .

###### Example 1

6.   We can now finally tackle the problem at the end of Example 1.3: choosing from the set . This comes down to computing . Because of Theorem 4.3, we can check if is rejected from by checking if . By Theorem 5.1, this requires us to check if for every we can find some and some such that . Since , and do the job for every . So we can reject . Checking if is rejected is analogous: we have to check if . In this case, we can use and for every in to conclude that is rejected as well. Since must contain at least one option because of (which applies because Theorem 3.1 and the consistency of imply that is coherent) it follows that . So based on the advisor’s earlier decisions and the axioms of coherence, it follows that the company should choose from .

In this simple toy example, the assessment was small and the conditions in Theorem 5.1 could be checked manually. In realistic problems, this may not be the case though. To address this, we will provide in Section 7 an algorithm for checking the conditions in Theorem 5.1. But first, we provide methods for reducing the size of an assessment.

## 6 Simplifying assessments

For any given assessment , the number of conditions that we have to check to apply Theorem 5.1 is proportional to the size of . Since Theorem 5.1 draws conclusions about rather than , it can thus be useful to try to make smaller without altering , as this will reduce the number of conditions that we have to check. This is especially true when we want to apply Theorem 5.1 to several sets , for example because we want to evaluate the natural extension of a choice function in multiple option sets.

To make smaller, a first straightforward step is to remove duplicates from ; after all, it is only the set that matters, not the list that generates it. To further reduce the size of , we need to reduce the size of and the option sets it consists of. To that end, we introduce a notion of equivalence for assessments.

###### Definition 6

For any two assessments , we say that and are equivalent if .

It follows immediately from Equations 4 and 5 that replacing an assessment with an equivalent one does not alter its consistency, nor, if it is consistent, its natural extension.

The following result shows that it is not necessary to directly simplify a complete assessment; it suffices to focus on simplifying subsets of assessments.

###### Proposition 3

If two assessments are equivalent and , then is equivalent to .

This result is important in practice because it means that we can build and simplify assessments gradually when new information arrives and that we can develop and use equivalence results that apply to small (subsets of) assessments.

A first simple such equivalence result is that we can always remove zero from any option set.

###### Proposition 4

Consider an option set . Then the assessment is equivalent to .

This result can be generalized so as to remove options for which there is a second option that can, by scaling, be made better than the first option.

###### Theorem 6.1

Consider an option set and two options such that and for some . Then the assessment is equivalent to .

If , this result—together with Proposition 3—guarantees that every option set in can be replaced by an equivalent option set of size at most two.

###### Proposition 5

Let and consider any option set . Then there is always an option set with at most two elements such that is equivalent to , and this option set can be found by repeated application of Theorem 6.1.

In the case of our running example, all the option sets in can even be reduced to singletons.

###### Example 1

7.   In we see that and in we see that . So, by Theorems 6.1 and 3, we can simplify the assessment of Example 1.4 to .

Our equivalence results so far were all concerned with removing options from the option sets in . Our next result goes even further: it provides conditions for removing the option sets themselves.

###### Theorem 6.2

Consider an assessments and an option set such that . Then is equivalent to .

###### Example 1

8.   Let us start from the assessment in Example 1.7. We will remove from this assessment using Theorem 6.2. To do that, we need to show that . To that end, we apply Theorem 5.1 for . Since , it follows that . We therefore check the second condition of Theorem 5.1. Since is a singleton, we only need to check the condition for a single tuple . For and , we find that . Hence, and we can therefore replace by the smaller yet equivalent assessment Taking into account our findings in Example 1.7, it follows that is equivalent to and, therefore, that .

Obviously, this makes it easier to evaluate . Suppose for example that we are asked to choose from , with and . By Equations 3 and 4.3, we can check if we can reject by checking if . For , and we see that , so Theorem 5.1 tells us that, indeed, . If we were to perform the same check directly for , then we would have to establish four inequalities—one for every —while now we only had to establish one.

## 7 Practical implementation

For large or complicated assessments, it will no longer be feasible to manually check the conditions in Theorem 5.1. In those cases, the algorithm that we are about to present can be used instead. According to Theorem 5.1, testing if an option set belongs to for some assessment sequence requires us to check if and, in case , if there is for every some and such that . If one of these two conditions is satisfied, then belongs to . The first condition is not complicated, as we just have to check for every if . For the second condition, the difficult part is how to verify, for any given and , whether there is some for which . If one of these two conditions is satisfied then belongs to . Given the importance of this basic step, we introduce a boolean function IsFeasible. For every and , it returns True if for at least one , and False otherwise.

So the only problem left is how to compute IsFeasible. The tricky part is the constraint that . By definition of , this can be rewritten as for all and , which are all linear constraints. Since the condition is linear as well, we have a linear feasibility problem to solve. However, strict inequalities such as are problematic for software implementations of linear feasibility problems. A quick fix is to choose some very small and impose the inequality instead, but since this is an approximation, it does not guarantee that the result is correct. A better solution is to use the following alternative characterisation that, by introducing an extra free variable, avoids the need for strict inequalities.333The result was inspired by a similar trick that Erik Quaegebeur employed in his CONEstrip algorithm .

###### Proposition 6

Consider any and any . Then IsFeasibleTrue if and only if there is a such that , for all , and .

Computing IsFeasible is therefore a matter of solving the following linear feasibility problem:

 find μ1,…,μn+1∈R, subject to μn+1s(x)−∑nj=1μjuj(x)≥0 for all x∈X, ∑nj=1μj≥1,μn+1≥1, and μj≥0 for all j∈{1,…,n}.

For finite

, such problems can be solved by standard linear programming methods; see for example

.

Together, Propositions 6 and 5.1 therefore provide a practical method to test if an option set belongs to , with . Pseudocode for this method is given in Algorithm 1. First, in lines 2 to 4, we check if . If it is, then and we thus return True. If this is not the case, and the assessment is empty, i.e. , then we have to return False, as we do in lines 5 and 6. Next, in lines 7 to 11, we run through all and search an for which IsFeasible True, i.e. for which there is some such that . As soon as we have found such an , we can break from the loop—halt the search—and go to the next . However, if we went through all of and we did not find such an , then the second condition of Theorem 5.1 is false for the current and thus does not belong to ; we then return False, as in lines 12 and 13. On the other hand, if we went through all and for every one of them we have found an such that IsFeasible=True, then we conclude that is in by the second condition of Theorem 5.1, so we return True.

###### Example 2

Roger is an expert in the pro snooker scene. An important game is coming soon where two players will play two matches. Betting sites will offer bets on the following three possible outcomes: the first player wins 2-0, a 1-1 draw, or the second player wins 2-0. So a bet corresponds with an option in , the components of which are the rewards for each of the three outcomes. Before the possible bets are put online, we ask Roger to provide us with an assessment. He agrees to do so, but tells us that we should not contact him again when the bets are online. We ask him to choose from the sets , and . He provides us with the choice assessment and Some time later, the betting site makes the following set of bets available:

 A={(−1,−1,2),\allowbreak(−4,−4,6),\allowbreak(−2,−10,6),\allowbreak(−1,0,−2),\allowbreak(−2,8,−6),\allowbreak(2,−4,4),\allowbreak(4,−6,1),\allowbreak(−3,8,5),\allowbreak(2,9,−9),\allowbreak(1,7,−3)}.

The question then is what bet to choose from , based on what Roger has told us. The assessment that correponds to Roger’s choice statements contains eight option sets. However, we can use Propositions 3, 6.2 and 6.1 to reduce to the equivalent assessment With Algorithms 1, 4.3 and 4.2, we find that the assessment is consistent and with subsequent runs of Algorithm 1, and using Equations 3 and 4.3, we find that So we can greatly reduce the number of bets to choose from but we cannot, based on the available information, deduce entirely what Roger would have chosen.

## 8 Conclusion and future work

The main conclusion of this work is that choice functions provide a principled as well as practically feasible framework for inferring new decisions from previous ones. The two key concepts that we introduced to achieve this were consistency and natural extension. The former allows one to check if an assessment of choices is compatible with the axioms of coherence, while the latter allows one to use these axioms to infer new choices. From a practical point of view, our main contribution is an algorithm that is able to execute both tasks. The key technical result that led to this algorithm consisted in establishing a connection with the framework of sets of desirable option sets. This allowed us to transform an assessment of choices into an assessment of desirable option sets, then simply this assessment, and finally execute the desired tasks directly in this setting.

Future work could add onto Section 6 by trying to obtain a ‘simplest’ representation for any given assessment, thereby reducing the computational complexity of our algorithm even further. We also intend to consider alternative forms of assessments, such as bounds on probabilities, bounds on expectations and preference statements, and show how they can be made to fit in our framework. Finally, we would like to apply our methods to a real-life decision problem.

### Acknowledgements

The work of Jasper De Bock was supported by his BOF Starting Grant “Rational decision making under uncertainty: a new paradigm based on choice functions”, number 01N04819.

## References

•  J. De Bock and G. De Cooman (2018) A desirability-based axiomatisation for coherent choice functions. In Proceedings of SMPS 2018, pp. 46–53. Cited by: §4, §4, Definition 3, Definition 5.
•  J. De Bock and G. De Cooman (2019) Interpreting, axiomatising and representing coherent choice functions in terms of desirability. In Proceedings of ISIPTA 2019, pp. 125–134. Cited by: §1, §2, §2.
•  J. De Bock (2020) Archimedean choice functions: an axiomatic foundation for imprecise decision making. External Links: Link Cited by: §1.
•  M. N. T. George B. Dantzig (2003) Linear programming: theory and extensions. 1 edition, , Vol. 2, Springer. External Links: ISBN 9780387215693,9780387986135,0387986138 Cited by: §7.
•  E. Quaeghebeur (2013) The CONEstrip algorithm. In Synergies of Soft Computing and Statistics for Intelligent Data Analysis, pp. 45–54. Cited by: footnote 3.
•  T. Seidenfeld, M. J. Schervish, and J. B. Kadane (2010) Coherent choice functions under uncertainty. Synthese 172 (1), pp. 157. Cited by: §1.
•  A. K. Sen (1971) Choice functions and revealed preference. The Review of Economic Studies 38 (3), pp. 307–317. Cited by: §2.
•  M. C. Troffaes (2007) Decision making under uncertainty using imprecise probabilities. International journal of approximate reasoning 45 (1), pp. 17–29. Cited by: §1.
•  A. Van Camp, E. Miranda, and G. De Cooman (2018) Natural extension of choice functions. In Proceedings of IPMU 2018, pp. 201–213. Cited by: §1.