Finite approximations to coherent choice

DOI10.1016/j.ijar.2008.07.001zbMath1186.62013arXiv1203.0919OpenAlexW1963643415MaRDI QIDQ962889

Matthias C. M. Troffaes

Publication date: 7 April 2010

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

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

zbMATH Keywords

decision makingsensitivity analysismaximalitynumerical analysislower prevision\(E\)-admissibility

Mathematics Subject Classification ID

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

Related Items

Sequential Decision Processes under Act-State Independence with Arbitrary Choice Functions ⋮ Maximum entropy derived and generalized under idempotent probability to address Bayes-frequentist uncertainty and model revision uncertainty: an information-theoretic semantics for possibility theory ⋮ Computing expectations with continuous \(p\)-boxes: univariate case ⋮ Finite approximations of data-based decision problems under imprecise probabilities

Cites Work

• Decision making under uncertainty using imprecise probabilities
• A representation of partially ordered preferences
• 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
• A Definition of Subjective Probability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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