Finite approximations to coherent choice

DOI10.1016/J.IJAR.2008.07.001zbMATH Open1186.62013arXiv1203.0919OpenAlexW1963643415MaRDI QIDQ962889FDOQ962889

Authors: Matthias C. M. Troffaes 

Publication date: 7 April 2010

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Abstract: This paper studies and bounds the effects of approximating loss functions and credal sets on choice functions, under very weak assumptions. In particular, the credal set is assumed to be neither convex nor closed. The main result is that the effects of approximation can be bounded, although in general, approximation of the credal set may not always be practically possible. In case of pairwise choice, I demonstrate how the situation can be improved by showing that only approximations of the extreme points of the closure of the convex hull of the credal set need to be taken into account, as expected.

Full work available at URL: https://arxiv.org/abs/1203.0919

Recommendations

• Approximation of choice function
• Errors bounds for finite approximations of coherent lower previsions on finite probability spaces
• Approximations of coherent lower probabilities by 2-monotone capacities
• Outer Approximations of Coherent Lower Probabilities Using Belief Functions
• 2-monotone outer approximations of coherent lower probabilities

zbMATH Keywords

decision makingsensitivity analysisnumerical analysismaximalitylower prevision\(E\)-admissibility

Mathematics Subject Classification ID

Statistical decision theory (62C99) Decision theory for games (91A35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Definition of Subjective Probability
• Decision making under uncertainty using imprecise probabilities
• A representation of partially ordered preferences
• Title not available (Why is that?)
• A Rubinesque theory of decision
• Title not available (Why is that?)
• Dynamic programming for deterministic discrete-time systems with uncertain gain
• Sensitivity of Decisions to Probability Estimation Errors: A Reexamination
• Sensitivity of Bayes Procedures to the Prior Distribution

Cited In (9)

• Approximation of choice functions with a constrained set of presentations
• Finiteness and choice
• Title not available (Why is that?)
• Maximum entropy derived and generalized under idempotent probability to address Bayes-frequentist uncertainty and model revision uncertainty: an information-theoretic semantics for possibility theory
• Finite approximations of data-based decision problems under imprecise probabilities
• Computing expectations with continuous \(p\)-boxes: univariate case
• Inference with Choice Functions Made Practical
• Approximation of choice function
• Sequential decision processes under act-state independence with arbitrary choice functions

This page was built for publication: Finite approximations to coherent choice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962889)