A Desirability-Based Axiomatisation for Coherent Choice Functions
Not on the map. Why?
Abstract (arXiv)
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules to imprecise-probabilistic uncertainty models. We provide them with a clear interpretation in terms of attitudes towards gambling, borrowing ideas from the theory of sets of desirable gambles, and we use this interpretation to derive a set of basic axioms. We show that these axioms lead to a full-fledged theory of coherent choice functions, which includes a representation in terms of sets of desirable gambles, and a conservative inference method.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 1.
5 papers.
- 2023A theory of desirable thingscited by 5
- 2021On a notion of independence proposed by Teddy Seidenfeldcited by 2
- 2022Decision-making with E-admissibility given a finite assessment of choicescited by 0
- 2023The logic behind desirable sets of things, and its filter representationcited by 0
- 2024Results about sets of desirable gamble setscited by 0
- 2024Results about sets of desirable gamble sets27 Apr 2024
- 2023The logic behind desirable sets of things, and its filter representation16 Feb 2023
- 2023A theory of desirable things15 Feb 2023
- 2022Decision-making with E-admissibility given a finite assessment of choices15 Apr 2022
- 2021On a notion of independence proposed by Teddy Seidenfeld20 Feb 2021