How can different individuals’ probability assignments to some events be aggregated into a collective probability assignment? Although there are several classic results on this problem, they all assume that the ‘agenda’of relevant events forms a -algebra, an overly demanding assumption for...

"Reason-based rationalizations" explain an agent's choices by specifying which properties of the options or choice context he/she cares about (the "motivationally salient properties") and how he/she cares about these properties the "fundamental preference relation"). We characterize the...

Rational choice theory analyzes how an agent can rationally act, given his or her preferences, but says little about where those preferences come from. Preferences are usually assumed to be fixed and exogenously given. Building on related work on reasons and rational choice (Dietrich and List,...

The widely discussed `discursive dilemma' shows that majority voting in a group of individuals on logically connected propositions may produce irrational collective judgments. We generalize majority voting by considering quota rules, which accept each proposition if and only if the number of...

Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and...

Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and...

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a σ-algebra and is thus closed under disjunction (union) and conjunction...

This paper characterizes different belief revision rules in a unified framework: Bayesian revision upon learning some event, Jeffrey revision upon learning new probabilities of some events, Adams revision upon learning some new conditional probabilities, and `dual-Jeffrey' revision upon learning...

What is the relationship between degrees of belief and (all-or-nothing) beliefs? Can the latter be expressed as a function of the former, without running into paradoxes? We reassess this “belief-binarization” problem from the perspective of judgmentaggregation theory. Although some...

How can different individuals' probability functions on a given σ-algebra of events be aggregated into a collective probability function? Classic approaches to this problem often require `event-wise independence': the collective probability for each event should depend only on the individuals'...