Decision making under uncertainty using imprecise probabilities

Abstract

Various ways for decision making with imprecise probabilities (admissibility, maximal expected utility, maximality, E-admissibility, $\Gamma$-maximax, $\Gamma$-maximin, all of which are well-known from the literature) are discussed and compared. We generalize a well-known sufficient condition for existence of optimal decisions. A simple numerical example shows how these criteria can work in practice, and demonstrates their differences. Finally, we suggest an efficient approach to calculate optimal decisions under these decision criteria.

11 pages

Cited by in corpus (23)

• Decision-Making with Belief Functions: a Review
• Logistic Regression, Neural Networks and Dempster-Shafer Theory: a New Perspective
• Conservative Inference Rule for Uncertain Reasoning under Incompleteness
• Computing Expectations with Continuous P-Boxes: Univariate Case
• Imprecise Monte Carlo simulation and iterative importance sampling for the estimation of lower previsions
• Blurring Out Cosmic Puzzles
• The Bayesian Who Knew Too Much
• Robust decision analysis under severe uncertainty and ambiguous tradeoffs: an invasive species case study
• Improving and benchmarking of algorithms for decision making with lower previsions
• Interpreting, axiomatising and representing coherent choice functions in terms of desirability
• Finite approximations to coherent choice
• Some multivariate imprecise shock model copulas
• Archimedean Choice Functions: an Axiomatic Foundation for Imprecise Decision Making
• Normal cones corresponding to credal sets of lower probabilities
• Improving and benchmarking of algorithms for $\Gamma$-maximin, $\Gamma$-maximax and interval dominance
• Learning Probabilities: Towards a Logic of Statistical Learning
• Constructing copulas from shock models with imprecise distributions
• Regret-based budgeted decision rules under severe uncertainty
• Credal Model Averaging for classification: representing prior ignorance and expert opinions
• An efficient algorithm for estimating state sequences in imprecise hidden Markov models
• Epistemic irrelevance in credal nets: the case of imprecise Markov trees
• Lexicographic choice functions
• A geometric approach to conditioning belief functions