Discoveries about attitude aggregation have prompted the re-emergence of non-reductionism, the theory that group agency is irreducible to individual agency. This paper rejects the revival of non-reductionism and, in so doing, challenges the preference for a unified account, according to which, agency, in all its manifestations, is rational. First, I offer a clarifying reconstruction of the new argument against reductionism. Second, I show that a hitherto silent premise, namely, that an identified group intention need not be determined by member attitudes (...) according to a rule, e.g., majority, is false. Third, I show that, on rejecting this premise, the aggregation results lead instead to the conclusion that, in contrast to individual agency, group agency is non-rational. (shrink)

Suppose that the members of a group each hold a rational set of judgments on some interconnected questions, and imagine that the group itself has to form a collective, rational set of judgments on those questions. How should it go about dealing with this task? We argue that the question raised is subject to a difficulty that has recently been noticed in discussion of the doctrinal paradox in jurisprudence. And we show that there is a general impossibility theorem that that (...) difficulty illustrates. Our paper describes this impossibility result and provides an exploration of its significance. The result naturally invites comparison with Kenneth Arrow's famous theorem (Arrow, 1963 and 1984; Sen, 1970) and we elaborate that comparison in a companion paper (List and Pettit, 2002). The paper is in four sections. The first section documents the need for various groups to aggregate its members' judgments; the second presents the discursive paradox; the third gives an informal statement of the more general impossibility result; the formal proof is presented in an appendix. The fourth section, finally, discusses some escape routes from that impossibility. (shrink)

The ``doctrinal paradox'' or ``discursive dilemma'' shows that propositionwise majority voting over the judgments held by multiple individuals on some interconnected propositions can lead to inconsistent collective judgments on these propositions. List and Pettit (2002) have proved that this paradox illustrates a more general impossibility theorem showing that there exists no aggregation procedure that generally produces consistent collective judgments and satisfies certain minimal conditions. Although the paradox and the theorem concern the aggregation of judgments rather than preferences, they invite comparison (...) with two established results on the aggregation of preferences: the Condorcet paradox and Arrow's impossibility theorem. We may ask whether the new impossibility theorem is a special case of Arrow's theorem, or whether there are interesting disanalogies between the two results. In this paper, we compare the two theorems, and show that they are not straightforward corollaries of each other. We further suggest that, while the framework of preference aggregation can be mapped into the framework of judgment aggregation, there exists no obvious reverse mapping. Finally, we address one particular minimal condition that is used in both theorems – an independence condition – and suggest that this condition points towards a unifying property underlying both impossibility results. (shrink)

Following Lauwers and Van Liedekerke (1995), this paper explores in a model-theoretic framework the relation between Arrovian aggregation rules and ultraproducts, in order to investigate a source of impossibility results for the case of an infinite number of individuals and an aggregation rule based on a free ultrafilter of decisive coalitions.

Hybrid belief aggregation addresses aggregation of individual probabilistic beliefs into collective binary beliefs. In line with the development of judgment aggregation theory, our research delves into the identification of precise agenda conditions associated with some key impossibility theorems in the context of hybrid belief aggregation. We determine the necessary and sufficient level of logical interconnection between the propositions in an agenda for some key impossibilities to arise. Specifically, we prove three characterization theorems about hybrid belief aggregation: (i) Precisely the path-connected (...) and pair-negatable agendas lead to the ‘oligarchy result’—only oligarchic rules satisfy universal domain, proposition-wise independence, respect for unanimity, and deductive closure of collective beliefs. (ii) Precisely the negation-connected agendas lead to the ‘triviality result’—only unanimity rules satisfy those conditions as well as anonymity. (iii) Precisely the blocked agendas lead to the ‘non-existence result’—no rules satisfy those conditions as well as completeness and consistency of collective beliefs. Furthermore, we compare these novel findings with existing agenda-theoretic characterization theorems in the domains of judgment aggregation and belief binarization. (shrink)

This paper addresses how multiple individual credences on logically related issues should be aggregated into collective binary beliefs. We call this binarizing belief aggregation. It is vulnerable to dilemmas such as the discursive dilemma or the lottery paradox: proposition-wise independent aggregation can generate inconsistent or not deductively closed collective judgments. Addressing this challenge using the familiar axiomatic approach, we introduce general conditions on a binarizing belief aggregation rule, including rationality conditions on individual inputs and collective outputs, and determine which rules (...) (if any) satisfy different combinations of these conditions. Furthermore, we analyze similarities and differences between our proofs and other related proofs in the literature and conclude that the problem of binarizing belief aggregation is a free-standing aggregation problem not reducible to judgment aggregation or probabilistic opinion pooling. (shrink)

Cerreia-Vioglio et al. :341–375, 2011) have proposed a very general axiomatisation of preferences in the presence of ambiguity, viz. Monotonic Bernoullian Archimedean preference orderings. This paper investigates the problem of Arrovian aggregation of such preferences—and proves dictatorial impossibility results for both finite and infinite populations. Applications for the special case of aggregating expected-utility preferences are given. A novel proof methodology for special aggregation problems, based on model theory, is employed.

An impossibility result for completely abstract social aggregation rules is presented. It is shown that non-imposition and a new no-veto property (two properties in the spirit of the Pareto principle and non-dictatorship respectively) are incompatible with an inter-profile consistency condition formulated in terms of proximity preservation.

Several recent results on the aggregation of judgments over logically connected propositions show that, under certain conditions, dictatorships are the only propositionwise aggregation functions generating fully rational (i.e., complete and consistent) collective judgments. A frequently mentioned route to avoid dictatorships is to allow incomplete collective judgments. We show that this route does not lead very far: we obtain oligarchies rather than dictatorships if instead of full rationality we merely require that collective judgments be deductively closed, arguably a minimal condition (...) of rationality, compatible even with empty judgment sets. We derive several characterizations of oligarchies and provide illustrative applications to Arrowian preference aggregation and Kasher and Rubinsteinís group identification problem. (shrink)

The aggregation of individual judgments over interrelated propositions is a newly arising field of social choice theory. I introduce several independence conditions on judgment aggregation rules, each of which protects against a specific type of manipulation by agenda setters or voters. I derive impossibility theorems whereby these independence conditions are incompatible with certain minimal requirements. Unlike earlier impossibility results, the main result here holds for any (non-trivial) agenda. However, independence conditions arguably undermine the logical structure of judgment aggregation. I (...) therefore suggest restricting independence to premises, which leads to a generalised premise-based procedure. This procedure is proven to be possible if the premises are logically independent. (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)

BackgroundA fundamental ethical challenge in conducting genomics research is the question of what and how individual level genetic findings and aggregate genomic results should be conveyed to research participants and communities. This is within the context of minimal guidance, policies, and experiences, particularly in Africa. The aim of this study was to explore the perspectives of key stakeholders' on returning genomics research results to participants in Kenya.MethodsThis qualitative study involved focus group discussions (FGDs) and in-depth interviews (IDIs) (...) with 69 stakeholders. The purposively selected participants, included research ethics committee (REC) members (8), community members (44), community resource persons (8), and researchers (9). A semi-structured interview guide was used to facilitate discussions. Six FGDs and twenty-five (IDIs) were conducted among the different stakeholders. The issues explored in the interviews included: (1) views on returning results, (2) kind of results to be returned, (3) value of returning results to participants, and (4) challenges anticipated in returning results to participants and communities. The interviews were audio-recorded, transcribed verbatim, and coded in Nvivo 12 pro. Thematic and content analysis was conducted.ResultsParticipants agreed on the importance of returning genomic results either as individual or aggregate results. The most cited reasons for returning of genomic results included recognizing participants' contribution to research, encouraging participation in future research, and increasing the awareness of scientific progress. Other aspects on how genomic research results should be shared included sharing easy to understand results in the shortest time possible and maintaining confidentiality when sharing sensitive results.ConclusionsThis study identified key stakeholders’ perspectives on returning genomic results at the individual and community levels in two urban informal settlements of Nairobi. The majority of the participants expect to receive feedback about their genomic results, and it is an obligation for researchers to see how to best fulfil it. (shrink)

How might we extend aggregative moral theories to compare infinite worlds? In particular, how might we extend them to compare worlds with infinite spatial volume, infinite temporal duration, and infinitely many morally valuable phenomena? When doing so, we face various impossibility results from the existing literature. For instance, the view we adopt can endorse the claim that worlds are made better if we increase the value in every region of space and time, or that they are made better if (...) we increase the value obtained by every person. But they cannot endorse both claims, so we must choose. In this paper I show that, if we choose the latter, our view will face serious problems such as generating incomparability in many realistic cases. Opting instead to endorse the first claim, I articulate and defend a spatiotemporal, expansionist view of infinite aggregation. Spatiotemporal views such as this do face some difficulties, but I show that these can be overcome. With modification, they can provide plausible comparisons in cases that we care about most. (shrink)

Suppose you found that the universe around you was infinite—that it extended infinitely far in space or in time and, as a result, contained infinitely many persons. How should this change your moral decision-making? Radically, it seems, according to some philosophers. According to various recent arguments, any moral theory that is ’minimally aggregative’ will deliver absurd judgements in practice if the universe is (even remotely likely to be) infinite. This seems like sound justification for abandoning any such theory. -/- My (...) goal in this thesis is simple: to demonstrate that we need not abandon minimally aggregative theories, even if we happen to live in an infinite universe. I develop and motivate an extension of such theories, which delivers plausible judgements in a range of realistic cases. I show that this extended theory can overcome key objections—both old and new—and that it succeeds where other proposals do not. With this proposal in hand, we can indeed retain minimally aggregative theories and continue to make moral decisions based on what will promote the good. (shrink)

In solving judgment aggregation problems, groups often face constraints. Many decision problems can be modelled in terms the acceptance or rejection of certain propositions in a language, and constraints as propositions that the decisions should be consistent with. For example, court judgments in breach-of-contract cases should be consistent with the constraint that action and obligation are necessary and sufficient for liability; judgments on how to rank several options in an order of preference with the constraint of transitivity; and judgments on (...) budget items with budgetary constraints. Often more or less demanding constraints on decisions are imaginable. For instance, in preference ranking problems, the transitivity constraint is often contrasted with the weaker acyclicity constraint. In this paper, we make constraints explicit in judgment aggregation by relativizing the rationality conditions of consistency and deductive closure to a constraint set, whose variation yields more or less strong notions of rationality. We review several general results on judgment aggregation in light of such constraints. (shrink)

Returning research results to participants is recognised as an obligation that researchers should always try to fulfil. But can we ascribe the same obligation to researchers who conduct genomics research producing only aggregated findings? And what about genomics research conducted in developing countries? This paper considers Beskow's et al. argument that aggregated findings should also be returned to research participants. This recommendation is examined in the context of genomics research conducted in developing countries. The risks and benefits of attempting (...) such an exercise are identified, and suggestions on ways to avoid some of the challenges are proposed. I argue that disseminating the findings of genomic research to participating communities should be seen as sharing knowledge rather than returning results. Calling the dissemination of aggregate, population level information returning results can be confusing and misleading as participants might expect to receive individual level information. Talking about sharing knowledge is a more appropriate way of expressing and communicating the outcome of population genomic research. Considering the knowledge produced by genomics research a worthwhile output that should be shared with the participants and approaching the exercise as a ‘sharing of knowledge’, could help mitigate the risks of unrealistic expectations and misunderstanding of findings, whilst promoting trusting and long lasting relationships with the participating communities. (shrink)

All existing impossibility theorems on judgment aggregation require individ- ual and collective judgment sets to be consistent and complete (in some recent results with completeness relaxed to deductive closure), arguably a demand- ing rationality requirement. They do not carry over to aggregation functions mapping pro…les of (merely) consistent individual judgment sets to (merely) consistent collective ones. We prove that, whenever the agenda of propositions under consideration exhibits mild interconnections, any such aggregation func- tion that is "neutral" between the acceptance (...) and rejection of each proposition is dictatorial. We relate this theorem to the literature. (shrink)

In solving judgment aggregation problems, groups often face constraints. Many decision problems can be modelled in terms the acceptance or rejection of certain propositions in a language, and constraints as propositions that the decisions should be consistent with. For example, court judgments in breach-of-contract cases should be consistent with the constraint that action and obligation are necessary and sufficient for liability; judgments on how to rank several options in an order of preference with the constraint of transitivity; and judgments on (...) budget items with budgetary constraints. Often more or less demanding constraints on decisions are imaginable. For instance, in preference ranking problems, the transitivity constraint is often contrasted with the weaker acyclicity constraint. In this paper, we make constraints explicit in judgment aggregation by relativizing the rationality conditions of consistency and deductive closure to a constraint set, whose variation yields more or less strong notions of rationality. We review several general results on judgment aggregation in light of such constraints. (shrink)

In recent years, judgement aggregation has emerged as an important area of social choice theory. Judgement aggregation is concerned with aggregating sets of individual judgements over logically connected propositions into a set of collective judgements. It has been shown that even seemingly weak conditions on the aggregation function make it impossible to find functions that produce rational collective judgements from all possible rational individual judgements. This implies that the step from individual judgements to collective judgements requires trade-offs between different desiderata, (...) such as universal domain, rationality, epistemological quality, and unbiasedness. These dilemmas challenge us to decide which conditions we should relax. The typical application for judgement aggregation is the problem of group decision making. Juries and expert committees are the stock examples. However, the relevance of judgement aggregation goes beyond these cases. In this survey I review some core results in the field of judgement aggregation and social epistemology and discuss their implications for the analysis of distributed thinking. (shrink)

We present an abstract social aggregation theorem. Society, and each individual, has a preorder that may be interpreted as expressing values or beliefs. The preorders are allowed to violate both completeness and continuity, and the population is allowed to be infinite. The preorders are only assumed to be represented by functions with values in partially ordered vector spaces, and whose product has convex range. This includes all preorders that satisfy strong independence. Any Pareto indifferent social preorder is then shown to (...) be represented by a linear transformation of the representations of the individual preorders. Further Pareto conditions on the social preorder correspond to positivity conditions on the transformation. When all the Pareto conditions hold and the population is finite, the social preorder is represented by a sum of individual preorder representations. We provide two applications. The first yields an extremely general version of Harsanyi's social aggregation theorem. The second generalizes a classic result about linear opinion pooling. (shrink)

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 all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than “premise-based voting”, (...) which is strategy-proof only for “reason-oriented” individuals. Surprisingly, for “outcome-oriented” individuals, the two rules are strategically equivalent, generating identical judgments in equilibrium. Our results introduce game-theoretic considerations into judgment aggregation and have implications for debates on deliberative democracy. (shrink)

Drawing on the so-called “doctrinal paradox”, List and Pettit (2002) have shown that, given an unrestricted domain condition, there exists no procedure for aggregating individual sets of judgments over multiple interconnected propositions into corresponding collective ones, where the procedure satisfies some minimal conditions similar to the conditions of Arrow’s theorem. I prove that we can avoid the paradox and the associated impossibility result by introducing an appropriate domain restriction: a structure condition, called unidimensional alignment, is shown to open up a (...) possibility result, similar in spirit to Black’s median voter theorem. Specifically, I prove that, given unidimensional alignment, propositionwise majority voting is the unique procedure for aggregating individual sets of judgments into collective ones in accordance with the above mentioned minimal conditions. (shrink)

This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation in logics (...) that are weaker than classical logic, we investigate whether some well-known impossibility results, that were tailored for classical logic, still apply to those weak systems. (shrink)

A general obligation to make aggregate research results available to participants has been widely supported in the bioethics literature. However, dementia research presents several challenges to this perspective, particularly because of the fear associated with developing dementia. The authors argue that considerations of respect for persons, beneficence, and justice fail to justify an obligation to make aggregate research results available to participants in dementia research. Nevertheless, there are positive reasons in favor of making aggregate research (...) results available; when the decision is made to do so, it is critical that a clear strategy for communicating results is developed, including what support will be provided to participants receiving aggregate research results. (shrink)

Judgment aggregation studies how collective opinions arise from the aggregation of individual ones. This article surveys a variety of aggregation rules (possible ways of aggregating individual judgments into collective ones). Aggregation by majority opinion is known to satisfy some but not all the desiderata for an aggregation rule. More general impossibility results show that not all the natural desiderata can be satisfied by a single aggregation rule. To interpret these results, we focus here on some applications of judgment (...) aggregation models in Epistemology. In particular, we explore their possible role in an account of collective belief and collective reason. The focus on these applications allows us to give precise answers concerning which of the natural desiderata must be abandoned. (shrink)

With the rapidly growing amounts of information, visualization is becoming increasingly important, as it allows users to easily explore and understand large amounts of information. However the field of information visualiza- tion currently lacks sufficient theoretical foundations. This article addresses foundational questions connecting information visualization with computing and philosophy studies. The idea of multiscale information granula- tion is described based on two fundamental concepts: information (structure) and computation (process). A new information processing paradigm of Granular Computing enables stepwise increase of (...) granulation/aggregation of information on different levels of resolution, which makes possible dynamical viewing of data. Information produced by Google Earth is an illustration of visualization based on clustering (granulation) of information on a succession of layers. Depending on level, specific emergent properties become visible as a result of different ways of aggregation of data/information. As information visualization ultimately aims at amplifying cognition, we discuss the process of simulation and emulation in relation to cognition, and in particular visual cognition. (shrink)

This paper provides an introductory review of the theory of judgment aggregation. It introduces the paradoxes of majority voting that originally motivated the field, explains several key results on the impossibility of propositionwise judgment aggregation, presents a pedagogical proof of one of those results, discusses escape routes from the impossibility and relates judgment aggregation to some other salient aggregation problems, such as preference aggregation, abstract aggregation and probability aggregation. The present illustrative rather than exhaustive review is intended to (...) give readers new to the field of judgment aggregation a sense of this rapidly growing research area. (shrink)

In two recent papers, Christian List and Philip Pettit have argued that there is a problem in the aggregation of reasoned judgements that is akin to the aggregation of the preference problem in social choice theory. 1 Indeed, List and Pettit prove a new general impossibility theorem for the aggregation of judgements, and provide a propositional interpretation of the social choice problem that suggests it is a special case of their impossibility result. 2 Specifically, they show that no judgement aggregation (...) function for a group is possible if the group seeks to satisfy certain `minimal conditions' designed to ensure that the function is both responsive to the individually rational views of its members and collectively rational in the set of judgements it holds. In this article, I resist the List and Pettit claim that there is the same propensity for collective irrationality or incoherence in the aggregation of reasoned judgements as there is in the aggregation of preference. I argue that reason, because it has a logical structure that is lacking in mere preference, has the effect of giving priority to some aggregations over others, a priority that is not permitted by one of the conditions imposed by List and Pettit. This avoids the incoherence that would otherwise exist if these different aggregations, not consistent with one another, were to compete at the same level of priority. The priority of some aggregations is particularly apparent, I shall argue, if one views the aggregation of judgements through the lens of common law decision-making. Key Words: social choice • judgement • Condorcet jury theorem • collective rationality • public reason • doctrinal paradox • discursive dilemma. (shrink)

Our aim in this survey article is to provide an accessible overview of some key results and questions in the theory of judgment aggregation. We omit proofs and technical details, focusing instead on concepts and underlying ideas.

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 individuals accepting it exceeds a given threshold, where different thresholds may be used for different propositions. After characterizing quota rules, we prove necessary and sufficient conditions on the required thresholds for various collective rationality requirements. We also consider sequential (...) quota rules, which ensure collective rationality by adjudicating propositions sequentially and letting earlier judgments constrain later ones. Sequential rules may be path-dependent and strategically manipulable. We characterize path-independence and prove its essential equivalence to strategy-proofness. Our results shed light on the rationality of simple-, super-, and sub-majoritarian decision-making. (shrink)

In 'How Should We Aggregate Competing Claims', Alex Voorhoeve suggests accommodating intuitions about duties in rescue cases by combining aggregative and non-aggregative elements into one theory. In this paper, I discuss two problems Voorhoeve’s theory faces as a result of requiring a cyclic pattern of choice, and argue that his attempt to solve them does not succeed.

Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invariance, adopted from the philosophy of science, and we argue for the normative desirability of translation invariance. We characterize the class of translation invariant aggregation functions in the canonical judgment aggregation model, which requires collective judgments to be complete. Since there are reasonable translation invariant aggregation functions, our result can be viewed as a possibility (...) theorem. At the same time, we show that translation invariance does have certain normatively undesirable consequences (e.g. failure of anonymity). We present a way of circumventing them by moving to a more general model of judgment aggregation, one that allows for incomplete collective judgments. (shrink)

The aim of this article is to introduce the theory of judgment aggregation, a growing interdisciplinary research area. The theory addresses the following question: How can a group of individuals make consistent collective judgments on a given set of propositions on the basis of the group members' individual judgments on them? I begin by explaining the observation that initially sparked the interest in judgment aggregation, the so-called "doctinal" and "discursive paradoxes". I then introduce the basic formal model of judgment aggregation, (...) which allows me to present some illustrative variants of a generic impossibility result. I subsequently turn to the question of how this impossibility result can be avoided, going through several possible escape routes. Finally, I relate the theory of judgment aggregation to other branches of aggregation theory. Rather than offering a comprehensive survey of the theory of judgment aggregation, I hope to introduce the theory in a succinct and pedagogical way, providing an illustrative rather than exhaustive coverage of some of its key ideas and results. (shrink)

The new …eld of judgment aggregation aims to …nd collective judgments on logically interconnected propositions. Recent impossibility results establish limitations on the possibility to vote independently on the propositions. I show that, fortunately, the impossibility results do not apply to a wide class of realistic agendas once propositions like “if a then b” are adequately modelled, namely as subjunctive implications rather than material implications. For these agendas, consistent and complete collective judgments can be reached through appropriate quota rules (...) (which decide propositions using acceptance thresholds). I characterise the class of these quota rules. I also prove an abstract result that characterises consistent aggregation for arbitrary agendas in a general logic. (shrink)

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)

Axiom weakening is a novel technique that allows for fine-grained repair of inconsistent ontologies. In a multi-agent setting, integrating ontologies corresponding to multiple agents may lead to inconsistencies. Such inconsistencies can be resolved after the integrated ontology has been built, or their generation can be prevented during ontology generation. We implement and compare these two approaches. First, we study how to repair an inconsistent ontology resulting from a voting-based aggregation of views of heterogeneous agents. Second, we prevent the generation of (...) inconsistencies by letting the agents engage in a turn-based rational protocol about the axioms to be added to the integrated ontology. We instantiate the two approaches using real-world ontologies and compare them by measuring the levels of satisfaction of the agents w.r.t. the ontology obtained by the two procedures. (shrink)

A necessary and sufficient condition for linear aggregation of SSB utility functionals is presented. Harsanyi's social aggregation theorem for von Neumann–Morgenstern utility functions is shown to be a corollary to this result. Two generalizations of Fishburn and Gehrlein's conditional linear aggregation theorem for SSB utility functionals are also established.

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)

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)

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)

Polyglutamine (polyQ) diseases are genetically inherited neurodegenerative disorders. They are caused by mutations that result in polyQ expansions of particular proteins. Mutant proteins form intranuclear aggregates, induce cytotoxicity and cause neuronal cell death. Protein interaction data suggest that polyQ regions modulate interactions between coiled‐coil (CC) domains. In the case of the polyQ disease spinocerebellar ataxia type‐1 (SCA1), interacting proteins with CC domains further enhance aggregation and toxicity of mutant ataxin‐1 (ATXN1). Here, we suggest that CC partners interacting with the polyQ (...) region of a mutant protein, increase its aggregation while partners that interact with a different region reduce the formation of aggregates. Computational analysis of genetic screens revealed that CC‐rich proteins are highly enriched among genes that enhance pathogenicity of polyQ proteins, supporting our hypothesis. We therefore suggest that blocking interactions between mutant polyQ proteins and their CC partners might constitute a promising preventive strategy against neurodegeneration. (shrink)

A 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context. All 1-ary contexts are aggregative according to the consequence relation of classical propositional logic (though not, for example, according to the consequence relation of intuitionistic propositional logic), and here we explore the extent of (...) this phenomenon, generalized to having arbitrary connectives playing the role of conjunction; among intermediate logics, LC, shows itself to occupy a crucial position in this regard, and to suggest a characterization, applicable to a broader range of consequence relations, in terms of a variant of the notion of idempotence we shall call componentiality. This is an analogue, for the consequence relations of propositional logic, of the notion of a conservative operation in universal algebra. (shrink)

The problem of how to rationally aggregate probability measures occurs in particular when a group of agents, each holding probabilistic beliefs, needs to rationalise a collective decision on the basis of a single ‘aggregate belief system’ and when an individual whose belief system is compatible with several probability measures wishes to evaluate her options on the basis of a single aggregate prior via classical expected utility theory. We investigate this problem by first recalling some negative results (...) from preference and judgment aggregation theory which show that the aggregate of several probability measures should not be conceived as the probability measure induced by the aggregate of the corresponding expected utility preferences. We describe how McConway’s :410–414, 1981) theory of probabilistic opinion pooling can be generalised to cover the case of the aggregation of infinite profiles of finitely additive probability measures, too; we prove the existence of aggregation functionals satisfying responsiveness axioms à la McConway plus additional desiderata even for infinite electorates. On the basis of the theory of propositional-attitude aggregation, we argue that this is the most natural aggregation theory for probability measures. Our aggregation functionals for the case of infinite electorates are neither oligarchic nor integral-based and satisfy a weak anonymity condition. The delicate set-theoretic status of integral-based aggregation functionals for infinite electorates is discussed. (shrink)

This paper articulates the structure of a two species of weakly aggregative necessity in a common idiom, neighbourhood semantics, using the notion of a k-filter of propositions. A k-filter on a non-empty set I is a collection of subsets of I which contains I, is closed under supersets on I, and contains ∪{Xi ≤ Xj : 0 ≤ i < j ≤ k} whenever it contains the subsets X0,…, Xk. The mathematical content of the proof that weakly aggregative modal logic (...) is complete relative to k-ary frame theory, the standard semantic idiom for weakly aggregative modal logic is presented in language-independent terms as a representation theorem for k-filters: every non-trivial k-filter is included in the union of ≤ k non-trivial filters. The elementary theory of k-filters is developed and then applied in the form of an ultrafilter extension result for k-ary frame theory. (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, nondictatorship and propositionwise independence. But it is only partially known 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) and Dietrich and List (2007a). (shrink)

I present an original model in judgment aggregation theory that demonstrates the general impossibility of consistently describing decision-making purely at the group level. Only a type of unanimity rule can guarantee a group decision is consistent with supporting reasons, and even this possibility is limited to a small class of reasoning methods. The key innovation is that this result holds when individuals can reason in different ways, an allowance not previously considered in the literature. This generalizes judgment aggregation to subjective (...) decision situations, implying that the discursive dilemma persists without individual agreement on the logical constraints. Notably, the model mirrors the typical method of choosing political representatives, and thus suggests that no voting procedure other than unanimity rule can guarantee representation that reflects electorate opinion. Finally, I apply the results to a normative argument for unanimity rule in contract theory and juries, as well as to problems posed for deliberative democratic theory and the concept of representation. (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)

Paradoxical results concerning judgment aggregation have recently been invoked to defend the thesis that a corporate agent can be morally responsible for a decision without any of its individual members bearing such responsibility. I contend that the arguments offered for this irreducibility thesis are inconclusive. They do not pay enough attention to how we evaluate individual moral responsibility, in particular not to the role that a flawed assessment of the normative reasons that bear on the issue to be decided (...) on play in this context. I go on to propose a method for distributing corporate responsibility to individual members within the judgment aggregation framework. (shrink)