We present a general framework for representing belief-revision rules and use it to characterize Bayes's rule as a classical example and Jeffrey's rule as a non-classical one. In Jeffrey's rule, the input to a belief revision is not simply the information that some event has occurred, as in Bayes's rule, but a new assignment of probabilities to some events. Despite their differences, Bayes's and Jeffrey's rules can be characterized in terms of the same axioms: "responsiveness", which requires that revised beliefs (...) incorporate what has been learnt, and "conservativeness", which requires that beliefs on which the learnt input is "silent" do not change. To illustrate the use of non-Bayesian belief revision in economic theory, we sketch a simple decision-theoretic application. (shrink)

Decision-making typically requires judgments about causal relations: we need to know the causal effects of our actions and the causal relevance of various environmental factors. We investigate how several individuals' causal judgments can be aggregated into collective causal judgments. First, we consider the aggregation of causal judgments via the aggregation of probabilistic judgments, and identify the limitations of this approach. We then explore the possibility of aggregating causal judgments independently of probabilistic ones. Formally, we introduce the problem of causal-network aggregation. (...) Finally, we revisit the aggregation of probabilistic judgments when this is constrained by prior aggregation of qualitative causal judgments. (shrink)

The philosophical controversy concerning the logical status of MAXENTmay be in large measure due to the conflation of two distinct logical roles:(1) A general inductive principle for updating subjective probabilities (2)a supposing rule for moving from one chance probability to another.When judged under standards of dynamic coherence appropriate to (1),MAXENT is found wanting. When judged in terms of the logic appro-priate to (2) MAXENT yields for convex closed constraint sets a reason-able selection function with interesting connections with sufficiency andconditioning. Indeed (...) it is just the features of MAXENT which make itappropriate for (2) which make it inappropriate for (1). MAXENT canbe thought of as part of Bayesian logic. But it is part of the logic ofsupposition rather than the logic of induction. (shrink)

Bayesian psychology, in what is perhaps its most familiar version, is incomplete: Jeffrey conditionalization is not a complete account of rational belief change. Jeffrey conditionalization is sensitive to the order in which the evidence arrives. This order effect can be so pronounced as to call for a belief adjustment that cannot be understood as an assimilation of incoming evidence by Jeffrey's rule. Hartry Field's reparameterization of Jeffrey's rule avoids the order effect but fails as an account of how new evidence (...) should be assimilated. (shrink)

Sometimes appearances provide epistemic support that gets undercut later. In an earlier paper I argued that standard Bayesian update rules are at odds with this phenomenon because they are ‘rigid’. Here I generalize and bolster that argument. I first show that the update rules of Dempster–Shafer theory and ranking theory are rigid too, hence also at odds with the defeasibility of appearances. I then rebut three Bayesian attempts to solve the problem. I conclude that defeasible appearances pose a more difficult (...) and pervasive challenge for formal epistemology than is currently thought. 1 The Challenge for Bayesianism1.1 Updating and experience1.2 The problem1.3 Objections2 The Challenge for Dempster–Shafer Theory2.1 Background on Dempster–Shafer theory2.2 The problem for Dempster–Shafer theory3 The Challenge for Ranking Theory4 The Appeal to Metacognition5 The Appeal to Richer Inputs6 The Appeal to a Generic Underminer7 Conclusion. (shrink)

Jeffrey conditionalization is generalized to the case in which new evidence bounds the possible revisions of a prior below by a Dempsterian lower probability. Classical probability kinematics arises within this generalization as the special case in which the evidentiary focal elements of the bounding lower probability are pairwise disjoint.

Theories of subjective probability are viewed as formal languages for analyzing evidence and expressing degrees of belief. This article focuses on two probability langauges, the Bayesian language and the language of belief functions (Shafer, 1976). We describe and compare the semantics (i.e., the meaning of the scale) and the syntax (i.e., the formal calculus) of these languages. We also investigate some of the designs for probability judgment afforded by the two languages.