Imprecise Probabilistic Beliefs
نویسنده
چکیده
Imprecise probabilistic beliefs are modelled as incomplete comparative likelihood relations admitting a multiple-prior representation. We provide an axiomatization of such relations for the case in which the set of priors is “convex-ranged”. We also show that the multiple-prior representation is unique whenever the set of priors is “almost-convex-ranged”. Such uniqueness ensures the adequacy of likelihood relations as models of probabilistic beliefs. In the second part of the paper, two conditions relating preferences and specified probabilistic beliefs are proposed. The weaker one requires simply that the decision maker prefer betting on events in line with specified likelihood comparisons. A somewhat stronger one amounts to a requirement of probabilistic sophistication relative to the specified probabilistic beliefs; it leads to an AnscombeAumann like structure derived in an epistemically enriched Savage framework. ∗e-mail: [email protected] ; homepage: http://www.econ.ucdavis.edu/faculty/nehring/ †Precursors of some of the ideas of this paper were presented in December 1996 at LOFT2 in Torino, Italy, July 2001 at RUD in Venice, Italy, and at the University of Heidelberg, and June 2002 at RUD in Paris.
منابع مشابه
Imprecise probabilistic beliefs as a context for decision-making under ambiguity
Coherent imprecise probabilistic beliefs are modelled as incomplete comparative likelihood relations admitting a multiple-prior representation. Under a structural assumption of Equidivisibility, we provide an axiomatization of such relations and show uniqueness of the representation. In the second part of the paper, we formulate a behaviorally general “Likelihood Compatibility” axiom relating p...
متن کاملA Syntax-based Framework for Merging Imprecise Probabilistic Logic Programs
In this paper, we address the problem of merging multiple imprecise probabilistic beliefs represented as Probabilistic Logic Programs (PLPs) obtained from multiple sources. Beliefs in each PLP are modeled as conditional events attached with probability bounds. The major task of syntax-based merging is to obtain the most rational probability bound for each conditional event from the original PLP...
متن کاملDecision-Making in the Context of Imprecise Probabilistic Beliefs
Coherent imprecise probabilistic beliefs are modelled as incomplete comparative likelihood relations admitting a multiple-prior representation. Under a structural assumption of Equidivisibility, we provide an axiomatization of such relations and show uniqueness of the representation. In the second part of the paper, we formulate a behaviorally general axiom relating preferences and probabilisti...
متن کاملRevising Imprecise Probabilistic Beliefs in the Framework of Probabilistic Logic Programming
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base which contains a set of conditional events with probability intervals. In this paper, we investigate the issue of revising such a PLP in light of receiving new information. We propose postulates for revising PLPs when a n...
متن کاملA Defense of Imprecise Credences in Inference and Decision Making1
Some Bayesians have suggested that beliefs based on ambiguous or incomplete evidence are best represented by families of probability functions. I spend the first half of this essay outlining one version of this imprecise model of belief , and spend the second half defending the model against recent objections, raised by Roger White and others, which concern the phenomenon of probabilistic dilat...
متن کامل