Results 11 to 20 of about 5,099 (218)

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.
Couso, Inés, Moral, Serafín
openaire   +1 more source

The CONEstrip algorithm [PDF]

, 2013
Uncertainty models such as sets of desirable gambles and (conditional) lower previsions can be represented as convex cones. Checking the consistency of and drawing inferences from such models requires solving feasibility and optimization problems.
D. Avis, F. Rinaldi, G. Coletti, G.M. Ziegler, I. Couso, P. Walley, P. Walley, P. Walley   +7 more
core   +2 more sources

Lexicographic choice functions without archimedeanicity [PDF]

, 2017
We investigate the connection between choice functions and lexicographic probabilities, by means of the convexity axiom considered by Seidenfeld, Schervisch and Kadane (2010) but without imposing any Archimedean condition.
A Sen, E Miranda, G Cooman De, G Cooman De, H Rubin, M Aizerman, T Schwartz, T Seidenfeld   +7 more
core   +2 more sources

Exchangeable choice functions [PDF]

, 2017
We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a counterpart of
de Cooman, Gert, Van Camp, Arthur
core   +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.
Jasper De Bock, Gert de Cooman
openaire   +2 more sources

Irrelevant and independent natural extension for sets of desirable gambles

Journal of Artificial Intelligence Research, 2012
The results in this paper add useful tools to the theory of sets of desirable gambles, a growing toolbox for reasoning with partial probability assessments. We investigate how to combine a number of marginal coherent sets of desirable gambles into a joint set using the properties of epistemic irrelevance and independence.
Cooman, Gert de, Miranda Menéndez, Enrique   +1 more
openaire   +4 more sources

Computable randomness is about more than probabilities [PDF]

, 2020
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense that we ...
CD Aliprantis, G De Cooman, G Shafer, II Gorban, J De Bock, J Rute, K Ambos-Spies, L Bienvenu, M Li, MB Pour-El, P Walley, RG Downey   +11 more
core   +2 more sources

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.
Benavoli, Alessio, Facchini, Alessandro, Zaffalon, Marco, Vicente-Pérez, José   +3 more
openaire   +3 more sources

Accept & Reject Statement-Based Uncertainty Models [PDF]

, 2015
We develop a framework for modelling and reasoning with uncertainty based on accept and reject statements about gambles. It generalises the frameworks found in the literature based on statements of acceptability, desirability, or favourability and ...
Alchourrón, Artzner, Couso, Davey, De Cooman, De Cooman, De Cooman, De Cooman, De Cooman, de Finetti, de Finetti, de Finetti, Dempster, Erik Quaeghebeur, Filip Hermans, Fishburn, Föllmer, Gert de Cooman, Good, Greenleaf, Hammer, Keynes, Koopman, Levi, Miranda, Pelessoni, Quaeghebeur, Quaeghebeur, Seidenfeld, Seidenfeld, Seidenfeld, Shafer, Shimony, Smith, Suppes, Wagner, Walley, Walley, Whittle, Williams, Williams, Williams   +41 more
core   +3 more sources

Credal Networks under Epistemic Irrelevance [PDF]

, 2017
A credal network under epistemic irrelevance is a generalised type of Bayesian network that relaxes its two main building blocks. On the one hand, the local probabilities are allowed to be partially specified.
De Bock, Jasper
core   +2 more sources