Recommendations
Cites work
- A survey of the theory of coherent lower previsions
- An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
- Coherence graphs
- Combining soft computing and statistical methods in data analysis. Papers based on the presentation at the 5th international conference on soft methods and probability and statistics (SMPS 2010), Oviedo and Mieres, Spain, September 28 -- October 1, 2009
- Computing lower and upper expectations under epistemic independence
- Conditional models: coherence and inference through sequences of joint mass functions
- Credal networks
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Epistemic independence for imprecise probabilities
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Epistemic irrelevance on sets of desirable gambles
- Forward irrelevance
- Graphoid properties of epistemic irrelevance and independence
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3514749 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 1735955 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 3211285 (Why is no real title available?)
- Independent natural extension
- Marginal extension in the theory of coherent lower previsions
- Notes on conditional previsions
- Probabilistic logic with independence
- Updating coherent previsions on finite spaces
- Weak and strong laws of large numbers for coherent lower previsions
Cited in
(28)- Epistemic independence for imprecise probabilities
- Sklar's theorem in an imprecise setting
- Comonotonicity for sets of probabilities
- Independent natural extension for infinite spaces
- Independence and 2-monotonicity: nice to have, hard to keep
- Information algebras in the theory of imprecise probabilities
- Independent natural extension for choice functions
- Comonotone lower probabilities with robust marginal distributions functions
- Graphoid properties of concepts of independence for sets of probabilities
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- Computing lower and upper expected first-passage and return times in imprecise birth-death chains
- Credal networks under epistemic irrelevance
- A behavioural justification for using sensitivity analysis in imprecise multinomial processes
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Robust Bayesian analysis in partially ordered plausibility calculi
- Conformity and independence with coherent lower previsions
- The use of Markov operators to constructing generalised probabilities
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Independent products in infinite spaces
- Irrelevant and independent natural extension for sets of desirable gambles
- On the complexity of propositional and relational credal networks
- Addressing ambiguity in randomized reinsurance stop-loss treaties using belief functions
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Independent natural extension
- Evaluating uncertainty with vertical barrier models
- On a notion of independence proposed by Teddy Seidenfeld
- Computing lower and upper expectations under epistemic independence
- Demystifying dilation
This page was built for publication: Independent natural extension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650526)
