Desirability
From MaRDI portal
Publication:2875982
Cited in
(24)- Exchangeable choice functions
- Credal networks under epistemic irrelevance
- On negative conglomerability
- Independent natural extension for choice functions
- Lexicographic choice functions
- Independent natural extension for infinite spaces
- On the imprecision of full conditional probabilities
- On the definition of favorableness
- Learning with imprecise probabilities as model selection and averaging
- Desirable gambles based on pairwise comparisons
- Coherent choice functions, desirability and indifference
- 2-coherent and 2-convex conditional lower previsions
- Exposing some points of interest about non-exposed points of desirability
- Desirability of conditionals
- A propositional CONEstrip algorithm
- Nonlinear desirability theory
- On a notion of independence proposed by Teddy Seidenfeld
- Randomness is inherently imprecise
- The logic behind desirable sets of things, and its filter representation
- Accept \& reject statement-based uncertainty models
- Conditioning, updating and lower probability zero
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Weak Dutch books with imprecise previsions
- The CONEstrip algorithm
This page was built for publication: Desirability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875982)