A Desirability-Based Axiomatisation for Coherent Choice Functions

June 04, 2018 Β· Declared Dead Β· πŸ› International Conference on Soft Methods in Probability and Statistics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jasper De Bock, Gert de Cooman arXiv ID 1806.01044 Category cs.AI: Artificial Intelligence Cross-listed math.PR Citations 25 Venue International Conference on Soft Methods in Probability and Statistics Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted