This paper deals with various connections that are found to exist between statistical estimation methods for decision-making and rules of group choice in the social choice area. Initially the aggregation of individual opinions is formulated as a pattern recognition problem; firstly it is shown that individual preferences lead to a natural representation in terms of binary patterns. Then we proceed to show how the search for a group preference pattern can be conducted by classifying the input preference (...) patterns into various ‘pattern classes’ and using the resulting classification boundaries to define the area of mutual agreement over some of the available alternatives. This leads to a decision-theoretic problem which consists in defining a decision rule (for classification) that is least likely to lead to misrecognition of arbitrary preference patterns. A maximum likelihood solution is obtained and compared with some well-known rules of group decision-making. Other solutions are also possible, on the basis of different optimality criteria, and their social choice interpretation is suggested. Finally, a method using Coleman's linear model for attributes is applied to yield group decision rules by feature weighting of election issues. (shrink)

This paper examines the aggregation of preferences with a finitely additive measure space of agents. We consider three types of non-dictatorship axioms: non-dictatorship, coalitional non-dictatorship, and atomic non-dictatorship. First, we show that the existence of an atom is a necessary and sufficient condition for the existence of a social welfare function that satisfies weak Pareto, independence of irrelevant alternatives, and coalitional non-dictatorship. Second, we simultaneously impose non-dictatorship and coalitional non-dictatorship, and specify a necessary and sufficient condition for the finitely (...) additive measure that guarantees the compatibility among the axioms. Third, we impose all non-dictatorship axioms and show that the corresponding measure is extremely restricted. (shrink)

In this paper, we explore the stability of the aggregation procedure of individual preferences. In particular, we propose the stability under the addition of social preference, which is a normative property of democratic collective decision making. We establish impossibility and possibility theorems for non-dictatorial aggregation procedures.

Consider a group of people whose preferences satisfy the axioms of one of the current versions of utility theory, such as von Neumann-Morgenstern (1944), Savage (1954), or Bolker-Jeffrey (1965). There are political and economic contexts in which it is of interest to find ways of aggregating these individual preferences into a group preference ranking. The question then arises of whether methods of aggregation exist in which the group’s preferences also satisfy the axioms of the chosen utility theory, and (...) in which at the same time the aggregation process satisfies certain plausible conditions (e.g., the Pareto conditions below). (shrink)

It is both a moral tragedy and a travesty of social justice that responses to present unacceptable levels of Greenhouse Gases often involve constraining development, and that the burden of t...

In preference aggregation a set of individuals express preferences over a set of alternatives, and these preferences have to be aggregated into a collective preference. When preferences are represented as orders, aggregation procedures are called social welfare functions. Classical results in social choice theory state that it is impossible to aggregate the preferences of a set of individuals under different natural sets of axiomatic conditions. We define a first-order language for social welfare functions and we give (...) a complete axiomatisation for this class, without having the number of individuals or alternatives specified in the language. We are able to express classical axiomatic requirements in our first-order language, giving formal axioms for three classical theorems of preference aggregation by Arrow, by Sen, and by Kirman and Sondermann. We explore to what extent such theorems can be formally derived from our axiomatisations, obtaining positive results for Sen’s Theorem and the Kirman-Sondermann Theorem. For the case of Arrow’s Theorem, which does not apply in the case of infinite societies, we have to resort to fixing the number of individuals with an additional axiom. In the long run, we hope that our approach to formalisation can serve as the basis for a fully automated proof of classical and new theorems in social choice theory. (shrink)

:Preference-aggregation problems arise in various contexts. One such context, little explored by social choice theorists, is metaethical. ‘Ideal-advisor’ accounts, which have played a major role in metaethics, propose that moral facts are constituted by the idealized preferences of a community of advisors. Such accounts give rise to a preference-aggregation problem: namely, aggregating the advisors’ moral preferences. Do we have reason to believe that the advisors, albeit idealized, can still diverge in their rankings of a given set (...) of alternatives? If so, what are the moral facts when the advisors do diverge? These questions are investigated here using the tools of Arrovian social choice theory. (shrink)

An important objection to preference-satisfaction theories of well-being is that they cannot make sense of interpersonal comparisons. A tradition dating back to Harsanyi :434, 1953) attempts to solve this problem by appeal to people’s so-called extended preferences. This paper presents a new problem for the extended preferences program, related to Arrow’s celebrated impossibility theorem. We consider three ways in which the extended-preference theorist might avoid this problem, and recommend that she pursue one: developing aggregation rules that violate (...) Arrow’s Independence of Irrelevant Alternatives condition. (shrink)

Patient preference predictors aim to solve the moral problem of making treatment decisions on behalf of incapacitated patients. This commentary on a case of an unrepresented patient at the end of life considers 3 related problems of such predictors: the problem of restricting the scope of inputs to the models (the “scope” problem), the problem of weighing inputs against one another (the “weight” problem), and the problem of multiple reasonable solutions to the scope and weight problems (the “multiple reasonable (...) models” problem). Each of these problems poses challenges to reliably implementing patient preference predictors in important, high-stakes health care decision making. This commentary also suggests a way forward. (shrink)

This paper is concerned with the efficiency of information aggregation in a committee whose members have heterogeneous preferences over a binary decision variable. We study a voting game with a pre-vote communication stage and identify conditions under which full information aggregation is possible. In particular, if preferences are common knowledge and each committee member is endowed with information, full information aggregation is possible despite preference heterogeneity.

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)

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)

The aggregation of individual judgments on logically connected issues often leads to collective inconsistency. This study examines two collective decision-making procedures designed to avoid such inconsistency—one premise-based and the other conclusion-based. While the relative desirability of the two procedures has been studied extensively from a theoretical perspective, the preference of individuals regarding the two procedures has been less studied empirically. In the present study, a scenario-based questionnaire survey of participant preferences for the two procedures was conducted, taking into (...) consideration prevailing social norms in the society to which the participants belong and the heterogeneity of the participants’ past experiences. Results show that a minority opinion not matching a prevailing social norm is more likely to be supported when the conclusion-based procedure is used. This can be explained by a basic property of the conclusion-based procedure: The procedure does not require voters to reveal their reasons for reaching a particular conclusion. This property proves appealing for participants who have a minority opinion. Such a finding is highly relevant to future studies on strategic behaviors in choosing a collective decision-making procedure. (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.

The article shows that a Paretian social welfare function can be history independent and time consistent only if a stringent set of conditions is verified. Individual utilities must be additive. The social welfare function must be a linear combination of these utilities. Social preferences are stationary only if, in addition, all individuals have the same constant discount rate. The results are implemented in two frameworks: deterministic dynamic choice and dynamic choice under uncertainty. The applications highlight that the conditions are unlikely (...) to be met by individual preferences, and that they severely restrict social preferences. (shrink)

Non-compensatory aggregation rules are applied in a variety of problems such as voting theory, multi-criteria analysis, composite indicators, web ranking algorithms and so on. A major open problem is the fact that non-compensability implies the analytical cost of loosing all available information about intensity of preference, i.e. if some variables are measured on interval or ratio scales, they have to be treated as measured on an ordinal scale. Here this problem has been tackled in its most general formulation, (...) that is when mixed measurement scales (interval, ratio and ordinal) are used and both stochastic and fuzzy uncertainties are present. Objectives of this article are first to present a comprehensive review of useful solutions already proposed in the literature and second to advance the state of the art mainly in the theoretical guarantee that weights have the meaning of importance coefficients and they can be summarized in a voting matrix. This is a key result for using non-compensatory Condorcet consistent rules. A proof on the probability of existence of ties in the voting matrix is also developed. (shrink)

How can the propositional attitudes of several individuals be aggregated into overall collective propositional attitudes? Although there are large bodies of work on the aggregation of various special kinds of propositional attitudes, such as preferences, judgments, probabilities and utilities, the aggregation of propositional attitudes is seldom studied in full generality. In this paper, we seek to contribute to …lling this gap in the literature. We sketch the ingredients of a general theory of propositional attitude aggregation and prove (...) two new theorems. Our …rst theorem simultaneously characterizes some prominent aggregation rules in the cases of probability, judgment and preference aggregation, including linear opinion pooling and Arrovian dictatorships. Our second theorem abstracts even further from the speci…c kinds of attitudes in question and describes the properties of a large class of aggregation rules applicable to a variety of belief-like attitudes. Our approach integrates some previously disconnected areas of investigation. (shrink)

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)

How can the propositional attitudes of several individuals be aggregated into overall collective propositional attitudes? Although there are large bodies of work on the aggregation of various special kinds of propositional attitudes, such as preferences, judgments, probabilities and utilities, the aggregation of propositional attitudes is seldom studied in full generality. In this paper, we seek to contribute to filling this gap in the literature. We sketch the ingredients of a general theory of propositional attitude aggregation and prove (...) two new theorems. Our first theorem simultaneously characterizes some prominent aggregation rules in the cases of probability, judgment and preference aggregation, including linear opinion pooling and Arrovian dictatorships. Our second theorem abstracts even further from the specific kinds of attitudes in question and describes the properties of a large class of aggregation rules applicable to a variety of belief-like attitudes. Our approach integrates some previously disconnected areas of investigation. (shrink)

Can a group be an orthodox rational agent? This requires the group's aggregate preferences to follow expected utility (static rationality) and to evolve by Bayesian updating (dynamic rationality). Group rationality is possible, but the only preference aggregation rules which achieve it (and are minimally Paretian and continuous) are the linear-geometric rules, which combine individual values linearly and combine individual beliefs geometrically. Linear-geometric preference aggregation contrasts with classic linear-linear preference aggregation, which combines both values and (...) beliefs linearly, but achieves only static rationality. Our characterisation of linear-geometric preference aggregation has two corollaries: a characterisation of linear aggregation of values (Harsanyi's Theorem) and a characterisation of geometric aggregation of beliefs. (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)

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 for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a (...) corollary of our second result. Although we thereby provide a new proof of Arrow’s theorem, our main aim is to identify the analogue of Arrow’s theorem in judgment aggregation, to clarify the relation between judgment and preference aggregation, and to illustrate the generality of the judgment aggregation model. JEL Classi…cation: D70, D71.. (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)

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

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.

An important objection to preference-satisfaction theories of well-being is that these theories cannot make sense of interpersonal comparisons of well-being. A tradition dating back to Harsanyi () attempts to respond to this objection by appeal to so-called extended preferences: very roughly, preferences over situations whose description includes agents’ preferences. This paper examines the prospects for defending the preference-satisfaction theory via this extended preferences program. We argue that making conceptual sense of extended preferences is less problematic than others have (...) supposed, but that even so extended preferences do not provide a promising way for the preference satisfaction theorist to make interpersonal well-being comparisons. Our main objection takes the form of a trilemma: depending on how the theory based on extended preferences is developed, either the result will be inconsistent with ordinary preference-satisfaction theory, or it will fail to recover sufficiently rich interpersonal well-being comparisons, or it will take on a number of other arguably odd and undesirable commitments. (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)

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)

Joe Horton argues that partial aggregation yields unacceptable verdicts in cases with risk and multiple decisions. I begin by showing that Horton’s challenge does not depend on risk, since exactly similar arguments apply to riskless cases. The underlying conflict Horton exposes is between partial aggregation and certain principles of diachronic choice. I then provide two arguments against these diachronic principles: they conflict with intuitions about parity, prerogatives, and cyclical preferences, and they rely on an odd assumption about diachronic (...) choice. Finally, I offer an explanation, on behalf of partial aggregation, for why these diachronic principles fail. (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)

Judgment aggregation theory generalizes social choice theory by having the aggregation rule bear on judgments of all kinds instead of barely judgments of preference. The theory derives from Kornhauser and Sager’s doctrinal paradox and Pettit’s discursive dilemma, which List and Pettit turned into an impossibility theorem – the first of a long list to come. After mentioning this formative stage, the paper restates what is now regarded as the “canonical theorem” of judgment aggregation theory. The last (...) part of paper discusses how judgment aggregation theory connects with social choice theory and can contribute to it; it singles out two representative applications, one to Arrow’s impossibility theorem and the other to the group identification problem. (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)

The Ostrogorski paradox and the discursive dilemma are seemingly unrelated paradoxes of aggregation. The former is discussed in traditional social choice theory, while the latter is at the core of the new literature on judgment aggregation. Both paradoxes arise when, in a group, each individual consistently makes a judgment, or expresses a preference, (in the form of yes or no) over specific propositions, and the collective outcome is in some respect inconsistent. While the result is logically inconsistent (...) in the case of the discursive paradox, it is not stable with respect to the level of aggregation in the case of the Ostrogorski paradox. In the following I argue that, despite these differences, the two problems have a similar structure. My conclusion will be twofold: on the one hand, the similarities between the paradoxes support the claim that these problems should be tackled using the same aggregation procedure; on the other hand, applying the same procedure to these paradoxes will help clarify the strengths and weaknesses of the aggregation method itself. More specifically, I will show that an operator defined in artificial intelligence to merge belief bases can deal with both paradoxes. (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)

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)

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)

Many collective decision making problems have a combinatorial structure: the agents involved must decide on multiple issues and their preferences over one issue may depend on the choices adopted for some of the others. Voting is an attractive method for making collective decisions, but conducting a multi-issue election is challenging. On the one hand, requiring agents to vote by expressing their preferences over all combinations of issues is computationally infeasible; on the other, decomposing the problem into several elections on smaller (...) sets of issues can lead to paradoxical outcomes. Any pragmatic method for running a multi-issue election will have to balance these two concerns. We identify and analyse the problem of generating an agenda for a given election, specifying which issues to vote on together in local elections and in which order to schedule those local elections. (shrink)