Judgment aggregation studies how to aggregate individual judgments on logically correlated propositions into collective judgments. Different logics can be used in judgment aggregation, for which Dietrich and Mongin have proposed a generalized model based on general logics. Despite its generality, however, all nonmonotonic logics are excluded from this model. This paper argues for using nonmonotonic logic in judgment aggregation. Then it generalizes Dietrich and Mongin’s model to incorporate a large class of nonmonotonic logics. This generalization broadens the theoretical boundaries of (...) judgment aggregation by proving that, even if these nonmonotonic logics are employed, certain typical impossibility results still hold. (shrink)

We introduce a conceptual model for reaching group decisions. Our model extends a well-known, single-agent cognitive model, the recognition-primed decision (RPD) model. The RPD model includes a recognition phase and an evaluation phase. Group extensions of the RPD model, applicable to a group of RPD agents, have been considered in the literature, however the proposed models do not formalize how distributed and possibly inconsistent information can be combined in either phase. We show how such information can be utilized by aggregating (...) it using a specific social choice method, namely judgment aggregation. Our model is applicable to hierarchical groups of agents containing at least one RPD agent. (shrink)

My focus is on aggregation of individual value rankings of alternatives to a collective value ranking. This is compared with aggregation o individual prefrences to a collective preference. While in an individual preference ranking the alternatives are ordered in accordance with one’s preferences, the order in a value ranking expresses one’s comparative evaluation of the alternatives, from the best to the worst. I suggest that, despite their formal similarity as rankings, this difference in the nature of individual inputs in two (...) aggregation scenarios has important implications: The kind of procedure that looks fine for aggregation of judgments is inappropriate for aggregation of preferences. The procedure I have in mind consists in similarity maximization, or – more precisely – in minimization of the average distance from individual inputs. When applied to judgment aggregation, this procedure can also be approached from the epistemic perspective: the questions are posed concerning its advantages as a truth-tracker. From that perspective, what matters is not only the probability of the outcome of the procedure being true, but also the expected verisimilitude of the outcome: its expected distance from truth. (shrink)

Judgment aggregation studies how individual opinions on a given set of propositions can be aggregated to form a consistent group judgment on the same propositions. Despite the simplicity of the problem, seemingly natural aggregation procedures fail to return consistent collective outcomes, leading to what is now known as the doctrinal paradox. The first occurrences of the paradox were discovered in the legal realm. However, the interest of judgment aggregation is much broader and extends to political philosophy, epistemology, social choice theory, (...) and computer science. The aim of this paper is to provide a concise survey of the discipline and to outline some of the most pressing questions and future lines of research. (shrink)

Judgment aggregation theory, or rather, as we conceive of it here, logical aggregation theory generalizes social choice theory by having the aggregation rule bear on judgments of all kinds instead of merely preference judgments. It derives from Kornhauser and Sager’s doctrinal paradox and List and Pettit’s discursive dilemma, two problems that we distinguish emphatically here. The current theory has developed from the discursive dilemma, rather than the doctrinal paradox, and the final objective of the paper is to give the latter (...) its own theoretical development along the line of recent work by Dietrich and Mongin. However, the paper also aims at reviewing logical aggregation theory as such, and it covers impossibility theorems by Dietrich, Dietrich and List, Dokow and Holzman, List and Pettit, Mongin, Nehring and Puppe, Pauly and van Hees, providing a uniform logical framework in which they can be compared with each other. The review goes through three historical stages: the initial paradox and dilemma, the scattered early results on the independence axiom, and the so-called canonical theorem, a collective achievement that provided the theory with its specific method of analysis. The paper goes some way towards philosophical logic, first by briefly connecting the aggregative framework of judgment with the modern philosophy of judgment, and second by thoroughly discussing and axiomatizing the ‘general logic’ built in this framework. (shrink)

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 theory of preference aggregation can be extended to this more general case. We first translate a proof of Arrow's impossibility theorem into the new setting, so as to motivate some of the central concepts and conditions leading to analogous (...) impossibilities, as discussed in the symposium. We then consider each of four possible escape-routes explored in the symposium. (shrink)

When a group of agents attempts to reach an agreement on certain issues, it is usually desirable that the resulting consensus be as close as possible to the original judgments of the individuals. However, when these judgments are logically connected to further beliefs, the notion of closeness should also take into account to what extent the individuals would have to revise their entire belief set to reach an agreement. In this work, we present a model for generation of agreement with (...) respect to a given agenda which allows individual epistemic entrenchment to influence the value of the consensus. While the postulates for the transformation function and their construction resemble those of AGM belief revision, the notion of an agenda is adapted from the theory of judgment aggregation. This allows our model to connect both frameworks. (shrink)

The aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on those propositions has recently drawn much attention. Seemingly reasonable aggregation procedures, such as propositionwise majority voting, cannot ensure an equally consistent collective conclusion. The literature on judgment aggregation refers to that problem as the discursive dilemma. In this paper, we motivate that many groups do not only want to reach a factually right conclusion, but also want to correctly evaluate the reasons for that conclusion. In (...) other words, we address the problem of tracking the true situation instead of merely selecting the right outcome. We set up a probabilistic model analogous to Bovens and Rabinowicz (2006) and compare several aggregation procedures by means of theoretical results, numerical simulations and practical considerations. Among them are the premise-based, the situation-based and the distance-based procedure. Our findings confirm the conjecture in Hartmann, Pigozzi and Sprenger (2008) that the premise-based procedure is a crude, but reliable and sometimes even optimal form of judgment aggregation. (shrink)

As the ongoing literature on the paradoxes of the Lottery and the Preface reminds us, the nature of the relation between probability and rational acceptability remains far from settled. This article provides a novel perspective on the matter by exploiting a recently noted structural parallel with the problem of judgment aggregation. After offering a number of general desiderata on the relation between finite probability models and sets of accepted sentences in a Boolean sentential language, it is noted that a number (...) of these constraints will be satisfied if and only if acceptable sentences are true under all valuations in a distinguished non-empty set W. Drawing inspiration from distance-based aggregation procedures, various scoring rule based membership conditions for W are discussed and a possible point of contact with ranking theory is considered. The paper closes with various suggestions for further research. (shrink)

This paper explores two non-standard supermajority rules in the context of judgment aggregation over multiple logically connected issues. These rules set the supermajority threshold in a local, context sensitive way—partly as a function of the input profile of opinions. To motivate the interest of these rules, I prove two results. First, I characterize each rule in terms of a condition I call ‘Block Preservation’. Block preservation says that if a majority of group members accept a judgment set, then so should (...) the group. Second, I show that one of these rules is, in a precise sense, a judgment aggregation analogue of a rule for connecting qualitative and quantitative belief that has been recently defended by Hannes Leitgeb. The structural analogy is due to the fact that Leitgeb sets thresholds for qualitative beliefs in a local, context sensitive way—partly as a function of the given credence function. (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)

Dung’s argumentation frameworks have been applied for over twenty years to the analysis of argument justification. This representation focuses on arguments and the attacks among them, abstracting away from other features like the internal structure of arguments, the nature of utterers, the specifics of the attack relation, etc. The model is highly attractive because it reduces most of the complexities involved in argumentation processes. It can be applied to different settings, like the argument evaluation of an individual agent or the (...) case of dialectic disputes between two agents (pro and con), or even in multi-agent collective argumentation. The latter case involves agents with possibly different arguments and/or opinions on how to evaluate them, leading to the possibility of considering multiple sets of arguments and attack relations. Two basic questions can be asked here, namely ‘what to aggregate’ and ‘how to aggregate’. The former concerns what kinds of entities do the agents intend to choose (arguments, attacks, assessments, etc.), while the second one focuses on which aggregation mechanisms yield rational choices (voting on arguments, merging procedures to obtain a common argumentation framework, deliberation processes, etc.). In particular, the question about the rationality of a collective argument choice relates this topic to Social Choice and Judgment Aggregation theories, while its associated strategic issues relate it to Game Theory. The research efforts on the disparate problems elicited by collective argumentation have generated a considerable corpus of literature that deserves an orderly evaluation. This survey is intended as a contribution to that end. (shrink)

Social choice theory is the study of collective decision processes and procedures. It is not a single theory, but a cluster of models and results concerning the aggregation of individual inputs (e.g., votes, preferences, judgments, welfare) into collective outputs (e.g., collective decisions, preferences, judgments, welfare). Central questions are: How can a group of individuals choose a winning outcome (e.g., policy, electoral candidate) from a given set of options? What are the properties of different voting systems? When is a voting system (...) democratic? How can a collective (e.g., electorate, legislature, collegial court, expert panel, or committee) arrive at coherent collective preferences or judgments on some issues, on the basis of its members' individual preferences or judgments? How can we rank different social alternatives in an order of social welfare? Social choice theorists study these questions not just by looking at examples, but by developing general models and proving theorems. (shrink)

I propose a relevance-based independence axiom on how to aggregate individual yes/no judgments on given propositions into collective judgments: the collective judgment on a proposition depends only on people’s judgments on propositions which are relevant to that proposition. This axiom contrasts with the classical independence axiom: the collective judgment on a proposition depends only on people’s judgments on the same proposition. I generalize the premise-based rule and the sequential-priority rule to an arbitrary priority order of the propositions, instead of a (...) dichotomous premise/conclusion order resp. a linear priority order. I prove four impossibility theorems on relevance-based aggregation. One theorem simultaneously generalizes Arrow’s Theorem (in its general and indifference-free versions) and the well-known Arrow-like theorem in judgment aggregation. (shrink)

The point of departure in my story is the contrast between two models of democratic voting process: popular democracy and what might be called committee democracy. On one interpretation, voting in popular democracy is a procedure whose function is to aggregate the individuals’ preferences to something like a collective preference, while in committee democracy what is being aggregated are committee members’ judgments. The relevant judgments on the agenda often address an evaluative question. It is such value judgments that this paper (...) focuses on. The question is how their aggregation differs from aggregation of preferences. I focus on the case in which the two aggregation scenarios exhibit a far-reaching structural similarity: more precisely, the case in which, in the judgment aggregation scenario, the individual inputs are value rankings. This means that, formally, the individual judgments in this case have the same structure as preference rankings over a given set of alternatives, but while in a preference ranking the alternatives are ordered in accordance with one’s preferences, a value ranking expresses one’s comparative evaluation of the alternatives: say, this alternative is best, those two alternatives are second-best, that alternative is third-best, etc. I suggest that this difference in the nature of individual inputs in two aggregation scenarios has important implications for the task of aggregation. In particular, distance-based methods that look fine for the aggregation of judgments turn out to be inappropriate for the aggregation of preferences: Minimization of distance from individual inputs violates the Pareto condition. When applied to judgment aggregation, distance-based methods can also be approached from the epistemic standpoint: the questions canl be posed concerning their advantages as a truth-tracker. In this context, what matters is not only the probability of the outcome of the aggregation procedure being true, but also the expected verisimilitude of the outcome: its expected distance from truth. (shrink)

The aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn much attention. Seemingly reasonable aggregation procedures, such as propositionwise majority voting, cannot ensure an equally consistent collective conclusion. The literature on judgment aggregation refers to such a problem as the \textit{discursive dilemma}. In this paper we assume that the decision which the group is trying to reach is factually right or wrong. Hence, we address the question of how good (...) the various approaches are at selecting the right conclusion. We focus on two approaches: distance-based procedures and a Bayesian analysis. They correspond to group-internal and group-external decision-making, respectively. We compare those methods in a probabilistic model, demonstrate the robustness of our results over various generalizations and discuss their applicability in different situations. The findings vindicate (i) that in judgment aggregation problems, reasons should carry higher weight than conclusions and (ii) that considering members of an advisory board to be highly competent is a better strategy than to underestimate their advice.". (shrink)

In this paper, I explore the possibility of applying the methods and results of Judgement Aggregation to the problem of logical disagreement. I develop and evaluate different ways in which individuals who logically disagree can generate a collective logic. I prove a version of the discursive paradox, where the majority voting of a group of structural logicians can give rise to a substructural logic; then I develop a more general impossibility result. After this, I analyze different ways to avoid the (...) paradox, in particular some methods which appeal to domain restrictions. Finally, I consider the application of these results to the discussion on semantic paradoxes. (shrink)

In the theory of judgment aggregation, it is known for which agendas of propositions it is possible to aggregate individual judgments into collective ones in accordance with the Arrow-inspired requirements of universal domain, collective rationality, unanimity preservation, non-dictatorship and propositionwise independence. But it is only partially known (e.g., only in the monotonic case) for which agendas it is possible to respect additional requirements, notably non-oligarchy, anonymity, no individual veto power, or implication preservation. We fully characterize the agendas for which there (...) are such possibilities, thereby answering the most salient open questions about propositionwise judgment aggregation. Our results build on earlier results by Nehring and Puppe (2002), Nehring (2006), Dietrich and List (2007a) and Dokow and Holzman (2010a). (shrink)

We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the (...) problem of the safety of the agenda). We provide results both for specific aggregation procedures (the quota rules, the premisebased procedure, and a distance-based procedure) and for classes of aggregation procedures characterised in terms of fundamental axioms. (shrink)