We argue that Nash’s solution to the bargaining problem should be modified such that it will be based on a New Reference Point (NRP). Such a point is needed so that a player is not considered ‘individually rational’ if he accepts an agreement that provides him with a utility lower than the...

While a large social-choice-theoretic literature discusses the aggregation of individual judgments into collective ones, there is relatively little formal work on the transformation of individual judgments in group deliberation. I develop a model of judgment transformation and prove a baseline...

If a group is modelled as a single Bayesian agent, what should its beliefs be? I propose an axiomatic model that connects group beliefs to beliefs of the group members. The group members may have different information, different prior beliefs and even different domains (algebras) within which...

In the framework of judgment aggregation, we assume that some formulas of the agenda are singled out as premisses, and that both Independence (formula-wise aggregation) and Unanimity Preservation hold for them. Whether premiss-based aggregation thus defined is compatible with conclusion-based...

In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue the op- posite. After proving a general impossibility...

The paper attached is the revised 23 April 2010 version.

This introduces the symposium on judgment aggregation. The theory of judgment aggregation asks how several individuals' judgments on some logically connected propositions can be aggregated into consistent collective judgments. The aim of this introduction is to show how ideas from the familiar...

In judgment aggregation, unlike preference aggregation, not much is known about domain restrictions that guarantee consistent majority outcomes. We introduce several conditions on individual judgments sufficient for consistent majority judgments. Some are based on global orders of propositions...

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...

We analyze a class of sender-receiver games with quadratic payoffs, which includes the communication games in Alonso, Dessein and Matouschek (2008) and Rantakari (2008) as special cases, for which the receiver's maximum expected payoff when players have access to arbitrary, mediated...