Results 1 to 10 of about 166 (158)
Infinite Exchangeability for Sets of Desirable Gambles [PDF]
Communications in Computer and Information Science, 2010 Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We study infinite exchangeability assessments for them, and give a counterpart of de Finetti’s infinite representation theorem.
Gert De Cooman +2 more
exaly +3 more sources
Exchangeability and sets of desirable gambles
International Journal of Approximate Reasoning, 2012 Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments for them, and prove counterparts of de Finetti's finite and infinite representation theorems.
Gert De Cooman, Erik Quaeghebeur
exaly +4 more sources
Sets of desirable gambles: Conditioning, representation, and precise probabilities
International Journal of Approximate Reasoning, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Inés Couso, Serafin Moral
exaly +2 more sources
Probability filters and desirable gambles [PDF]
International Journal of Approximate ReasoningIn this paper we propose a mathematical model for imprecise probability representing an agent's uncertain beliefs. The proposed model is closely related to the credal set model, which uses a set of probability functions. The credal set model can be conceived of as encoding judgements such as it seeming more likely that it'll rain than snow. It requires
exaly +3 more sources
Credal networks under epistemic irrelevance: The sets of desirable gambles approach
International Journal of Approximate Reasoning, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gert De Cooman, Jasper de Bock
exaly +4 more sources
Desirable gambles based on pairwise comparisons
International Journal of Approximate Reasoning, 2023 This paper proposes a model for imprecise probability information based on bounds on probability ratios, instead of bounds on events. This model is studied in the language of coherent sets of desirable gambles, which provides an elegant mathematical formulation and a more expressive power.
openaire +3 more sources
Quantum indistinguishability through exchangeable desirable gambles
, 2021 Two particles are identical if all their intrinsic properties, such as spin and charge, are the same, meaning that no quantum experiment can distinguish them. In addition to the well known principles of quantum mechanics, understanding systems of identical particles requires a new postulate, the so called symmetrization postulate. In this work, we show
Alessio Benavoli +2 more
openaire +3 more sources
Indexing gamble desirability by extending proportional stochastic dominance [PDF]
Games and Economic Behavior, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ziv Hellman, Amnon Schreiber
openaire +3 more sources
When (and why) absolute decision attribute values influence human preferences
Acta PsychologicaRelative rank models of risky decision-making suggest that human preferences are informed by sampled (and not absolute) values and their relative ranks.
Joseph Teal, Petko Kusev, Rose Martin
doaj +1 more source
A polarity theory for sets of desirable gambles
, 2017 Coherent sets of almost desirable gambles and credal sets are known to be equivalent models. That is, there exists a bijection between the two collections of sets preserving the usual operations, e.g. conditioning. Such a correspondence is based on the polarity theory for closed convex cones.
Alessio Benavoli +3 more
openaire +4 more sources