Normative Uncertainty and Social Choice

Mind ◽  
2018 ◽  
Vol 128 (512) ◽  
pp. 1285-1308 ◽  
Author(s):  
Christian Tarsney

Abstract In ‘Normative Uncertainty as a Voting Problem’, William MacAskill argues that positive credence in ordinal-structured or intertheoretically incomparable normative theories does not prevent an agent from rationally accounting for her normative uncertainties in practical deliberation. Rather, such an agent can aggregate the theories in which she has positive credence by methods borrowed from voting theory—specifically, MacAskill suggests, by a kind of weighted Borda count. The appeal to voting methods opens up a promising new avenue for theories of rational choice under normative uncertainty. The Borda rule, however, is open to at least two serious objections. First, it seems implicitly to ‘cardinalize’ ordinal theories, and so does not fully face up to the problem of merely ordinal theories. Second, the Borda rule faces a problem of option individuation. MacAskill attempts to solve this problem by invoking a measure on the set of practical options. But it is unclear that there is any natural way of defining such a measure that will not make the output of the Borda rule implausibly sensitive to irrelevant empirical features of decision-situations. After developing these objections, I suggest an alternative: the McKelvey uncovered set, a Condorcet method that selects all and only the maximal options under a strong pairwise defeat relation. This decision rule has several advantages over Borda and mostly avoids the force of MacAskill’s objection to Condorcet methods in general.

1991 ◽  
Vol 02 (03) ◽  
pp. 221-228 ◽  
Author(s):  
Lluís Garrido ◽  
Vicens Gaitan

We have tested a neural network (NN) technique as a method to determine the helicity of the τ particles in the process: e+e−→(Z0, γ*)→τ+τ−→(ρν)(ρν). It takes into account in a natural way the fact that both taus have different helicity and gives efficiencies comparable to the Bayesian method. We have found this “academic” example a nice way to introduce the analytical interpretation of the net output, showing that these neural nets techniques are equivalent to a Bayesian Decision Rule.


Author(s):  
Jose Luis Garcia-Lapresta ◽  
Bonifacio Llamazares ◽  
Miguel Martinez-Panero

Author(s):  
Andrei Marius Vlăducu

The authors analyze three social choice rules (plurality voting, approval voting and Borda count) from a behavioral economics perspective aiming three objectives: 1) if it is a viable solution to use these procedures during mass elections; 2) why individuals prefer a specific social choice rule and not another; 3) how status quo bias and framing effect influence the preference of individuals for a certain social choice rule. The research is conducted with 87 participants to a lab experiment and data suggest that for using approval voting and Borda count during mass elections is necessary to increase the people level of information about their benefits. When making a decision in a political or economic context seem that people tend to prefer simple plurality rule do to its availability and maybe because of its strong reliance with status quo bias.


Legal Theory ◽  
1995 ◽  
Vol 1 (2) ◽  
pp. 113-147 ◽  
Author(s):  
Edward P. Schwartz ◽  
Warren F. Schwartz

This article is about decision making by juries in capital cases. A jury is a collection of individuals who may possess differing views about factors relevant to the task before them, but who must, nonetheless, arrive collectively at a decision. As such, the members of the jury face a classic social choice problem. We investigate how this problem is likely to be resolved under various institutional regimes, differentiated by the set of individuals who are allowed to participate and the decision rule controlling their activities. As in our previous paper analyzing decision making by juries, we focus here on an aspect of the process that has been neglected in judicial opinions and academic scholarship: namely to what extent, and how, persistent disagreement among jurors can and will be resolved.


2020 ◽  
pp. 57-76
Author(s):  
William MacAskill ◽  
Krister Bykvist ◽  
Toby Ord

We introduce and discuss the problems of intertheoretic incomparability and merely ordinal theories. We then introduce the analogy between decision-making under moral uncertainty and social choice, and explain how this analogy can help us to overcome these problems. The rest of the chapter is spent fleshing out how this idea can help us to develop a theory of decision-making under moral uncertainty that is applicable even when all theories under consideration are merely ordinal, and even when there is neither level-nor unit- comparability between those theories. We consider whether My Favourite Theory or My Favourite Option might be the right theory of decision-making under moral uncertainty in conditions of merely ordinal theories and incomparability, but reject both of these accounts. We defend the idea that, when maximizing choice worthiness is not possible, one should use the Borda Rule instead.


Author(s):  
Zoïnabo Savadogo ◽  
Blaise Somé

Voting plays a vital role in any society. Indeed the votes involve decision making especially and the more in the decision of group. Thanks to the opinions expressed by a group of people, an opinion representing the preference of the group is determined. But most often some voting methods seem to distance the result from a vote of the general opinion. The study of voting methods is based on the theory of social choice. For several years, in the literature on the theory of social choice, many theorists have contributed trying to find a representative voting method.It seems that there is no totally satisfactory way of voting.Thus we have tried, through this article, to design a voting method based on approval voting and the arithmetic mean that leads to goodcompromise results.In contrast to the other methods, the new method takes into account the choice of each voter and allows to obtain a result which represents the choice of the majority of the voters.


2020 ◽  
Vol 34 (10) ◽  
pp. 14001-14002
Author(s):  
Julian Zucker

Combining the decisions of multiple agents into a final decision requires the use of social choice mechanisms. Pairwise decisions are often incomplete and intransitive, preventing the use of Borda count and other position-based social choice mechanisms. We propose and compare multiple methods for converting incomplete intransitive pairwise vote sets to complete rankings, enabling position-based social choice methods. The algorithms are evaluated on their output's Kendall's τ similarity when implementing pairwise social choice mechanisms. We show that there is only a small difference between the outputs of social choice methods on the original pairwise vote set and the generated ranking set on a real-world pairwise voting dataset. Source code for the analysis is available.1


Author(s):  
Juan Carlos Candeal ◽  
Esteban Induráin

In this paper we study aggregation operators that are point-sensitive which means that their values depend on the point where the functions to be aggregated are defined, as well as on the values of those functions at that point. This analysis gives rise to consider several functional equations that appear in a natural way. Further applications in mathematical social choice also appear as a by-product. In particular, we characterize the representation of certain social choice rules by means of specific numerical functions.


Sign in / Sign up

Export Citation Format

Share Document