# An alternative approach to coherent choice functions

@article{Bock2019AnAA, title={An alternative approach to coherent choice functions}, author={Jasper De Bock and Gert de Cooman}, journal={ArXiv}, year={2019}, volume={abs/1903.00336} }

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 appear in imprecise-probabilistic decision making. We provide these choice functions with a clear interpretation in terms of desirability, use this interpretation to derive a set of basic coherence axioms, and show that this notion of coherence leads to a representation in terms of sets of strict…

## Topics from this paper

## References

SHOWING 1-10 OF 25 REFERENCES

A Desirability-Based Axiomatisation for Coherent Choice Functions

- Computer Science, MathematicsSMPS
- 2018

This work provides a clear interpretation in terms of attitudes towards gambling, borrowing ideas from the theory of sets of desirable gambles, and uses this interpretation to derive a set of basic axioms, which lead to a full-fledged theory of coherent choice functions.

Coherent choice functions under uncertainty

- Mathematics, Computer ScienceSynthese
- 2009

This paper axiomatize the theory of choice functions and shows these axioms are necessary for coherence using a set of probability/almost-state-independent utility pairs, and gives sufficient conditions when a choice function satisfying the authors' axiom is represented by a setof probability/state- independent utility pairs with a common utility.

Lexicographic choice functions

- Computer Science, MathematicsInt. J. Approx. Reason.
- 2018

It is proved that choice functions based on sets of desirable options (gambles) satisfy Seidenfeld's convexity axiom only for very particular types of sets of undesirable options, which are exactly those that are representable by lexicographic probability systems that have no non-trivial Savage-null events.

Modelling Indifference with Choice Functions

- Mathematics
- 2015

We investigate how to model indifference with choice functions. We take the coherence axioms for choice functions proposed by Seidenfeld, Schervisch and Kadane as a source of inspiration, but modify…

Towards a unified theory of imprecise probability

- Computer Science, MathematicsInt. J. Approx. Reason.
- 2000

Two other models for uncertainty, which involve partial preference orderings and sets of desirable gambles, are discussed, and they may provide a suitable mathematical foundation for a unified theory of imprecise probability.

Exchangeability and sets of desirable gambles

- Computer Science, MathematicsInt. J. Approx. Reason.
- 2012

It is shown that the finite representation in terms of count vectors has a very nice geometrical interpretation, and that the representation in Terms of frequency vectors is tied up with multivariate Bernstein (basis) polynomials.

The Shape of Incomplete Preferences

- Mathematics, Computer ScienceISIPTA
- 2003

This paper presents a simple axiomatization of incomplete preferences and characterizes the shape of their representing sets of probabilities and utilities.

Choice functions as a tool to model uncertainty

- Mathematics
- 2014

Our aim is to develop a tool for modelling different types of assessments about the uncertain value of some random variable. One well-know and widely used way to model uncertainty is using…

A Representation of Partially Ordered Preferences

- Mathematics
- 1995

This essay considers decision-theoretic foundations for robust Bayesian statistics. We modify the approach of Ramsey, de Finetti, Savage and Anscombe and Aumann in giving axioms for a theory of…

Sets of desirable gambles: Conditioning, representation, and precise probabilities

- Computer Science, MathematicsInt. J. Approx. Reason.
- 2011

An overview of some of the fundamental concepts for reasoning with uncertainty expressed in terms of desirable gambles in the finite case are given, a characterization of regular extension is provided, and the nature of maximally coherent sets of desirable gamblers is studied.