Epistemic irrelevance on sets of desirable gambles

DOI10.1007/s10472-005-9011-0zbMath1092.68097OpenAlexW2139733451MaRDI QIDQ819949

Serafín Moral

Publication date: 4 April 2006

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-005-9011-0

zbMATH Keywords

conditioningimprecise probabilitiesepistemic independenceepistemic irrelevancedesirable gambles

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (25)

Probabilistic logic with independence ⋮ Conformity and independence with coherent lower previsions ⋮ Credal networks under epistemic irrelevance ⋮ Computing lower and upper expectations under epistemic independence ⋮ Sets of probability distributions, independence, and convexity ⋮ Lexicographic choice functions ⋮ Epistemic irrelevance in credal nets: the case of imprecise Markov trees ⋮ Desirability foundations of robust rational decision making ⋮ Conditioning, updating and lower probability zero ⋮ Representation theorems for partially exchangeable random variables ⋮ Exchangeability and sets of desirable gambles ⋮ Modelling epistemic irrelevance with choice functions ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Notes on desirability and conditional lower previsions ⋮ Sets of desirable gambles: conditioning, representation, and precise probabilities ⋮ Independent natural extension ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ Graphoid properties of concepts of independence for sets of probabilities ⋮ A survey of the theory of coherent lower previsions ⋮ Coherent choice functions, desirability and indifference ⋮ IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR ⋮ Full conglomerability ⋮ Independent natural extension for choice functions ⋮ Predictive Inference Under Exchangeability, and the Imprecise Dirichlet Multinomial Model ⋮ Asymmetric decomposability and persegram representation in coherent conditional probability theory

Cites Work

• Unnamed Item
• Graphoid properties of epistemic irrelevance and independence
• Semigraphoids and structures of probabilistic conditional independence
• Credal networks
• Strong conditional independence for credal sets
• Towards a unified theory of imprecise probability
• Epistemic independence for imprecise probabilities

This page was built for publication: Epistemic irrelevance on sets of desirable gambles