The average voting rule is a rule for group decision-making when the decision is a distribution (e.g. the allocation of a budget among different issues), and each of the voters reports his ideal distribution. This is a special case of budget-proposal aggregation. It is a simple aggregation rule, that returns the arithmetic mean of all individual ideal distributions. The average rule was first studied formally by Michael Intrilligator. [1] This rule and its variants are commonly used in economics and sports. [2] [3]
Intrilligator proved [1] that the average rule is the unique rule that satisfies the following three axioms:
An important disadvantage of the average rule is that it is not strategyproof – it is easy to manipulate. [4] For example, suppose there are two issues, the ideal distribution of Alice is (80%, 20%), and the average of the ideal distributions of the other voters is (60%, 40%). Then Alice would be better off if she reports that her ideal distribution is (100%, 0%), since this will pull the average distribution closer to her ideal distribution.
If all voters try to manipulate simultaneously, the computed average may be substantially different than the "real" average: in a two-issue setting with true average close to (50%, 50%), the computed average may vary by up to 20 percentage points when there are many voters, and the effect can be more extreme when the true average is more lopsided. [4]
The weighted average rule gives different weights to different voters (for example, based on their level of expertise).
The trimmed average rule discards some of the extreme bids, and returns the average of the remaining bids.
Renault and Trannoy study the combined use of the average rule and the majority rule, and their effect on minority protection. [3]
Rosar [2] compares the average voting rule to the median voting rule, when the voters have diverse private information and interdependent preferences. For uniformly distributed information, the average report dominates the median report from a utilitarian perspective, when the set of admissible reports is designed optimally. For general distributions, the results still hold when there are many agents.
Arrow's impossibility theorem is a key result in social choice theory, showing that no ranking-based decision rule can satisfy the requirements of rational choice theory. Most notably, Arrow showed that no such rule can satisfy independence of irrelevant alternatives, the principle that a choice between two alternatives A and B should not depend on the quality of some third, unrelated option C.
The highest averages, divisor, or divide-and-round methods are a family of apportionment algorithms that aim to fairly divide a legislature between several groups, such as political parties or states. More generally, divisor methods can be used to round shares of a total, e.g. percentage points.
The Gibbard–Satterthwaite theorem is a theorem in voting theory. It was first conjectured by the philosopher Michael Dummett and the mathematician Robin Farquharson in 1961 and then proved independently by the philosopher Allan Gibbard in 1973 and economist Mark Satterthwaite in 1975. It deals with deterministic ordinal electoral systems that choose a single winner, and shows that for every voting rule of this form, at least one of the following three things must hold:
A random ballot or random dictatorship is a randomized electoral system where the election is decided on the basis of a single randomly-selected ballot. A closely-related variant is called random serialdictatorship, which repeats the procedure and draws another ballot if multiple candidates are tied on the first ballot.
The median voter theorem in political science and social choice theory, developed by Duncan Black, states that if voters and candidates are distributed along a one-dimensional spectrum and voters have single-peaked preferences, any voting method that is compatible with majority-rule will elect the candidate preferred by the median voter. The median voter theorem thus shows that under a realistic model of voter behavior, Arrow's theorem, which essentially suggests that ranked-choice voting systems cannot eliminate the spoiler effect, does not apply, and therefore that rational social choice is in fact possible if the election system is using a Condorcet method.
Social choice theory is a branch of welfare economics that analyzes methods of combining individual opinions, beliefs, or preferences to reach a collective decision or create measures of social well-being. It contrasts with political science in that it is a normative field that studies how societies should make decisions, whereas political science is descriptive. Social choice incorporates insights from economics, mathematics, philosophy, political science, and game theory to find the best ways to combine individual preferences into a coherent whole, called a social welfare function.
A Lindahl tax is a form of taxation conceived by Erik Lindahl in which individuals pay for public goods according to their marginal benefits. In other words, they pay according to the amount of satisfaction or utility they derive from the consumption of an additional unit of the public good. Lindahl taxation is designed to maximize efficiency for each individual and provide the optimal level of a public good.
Maximal lotteries refers to a probabilistic voting rule. The method uses preferential ballots and returns a probability distribution of candidates that a majority of voters would weakly prefer to any other.
A simultaneous eating algorithm(SE) is an algorithm for allocating divisible objects among agents with ordinal preferences. "Ordinal preferences" means that each agent can rank the items from best to worst, but cannot (or does not want to) specify a numeric value for each item. The SE allocation satisfies SD-efficiency - a weak ordinal variant of Pareto-efficiency (it means that the allocation is Pareto-efficient for at least one vector of additive utility functions consistent with the agents' item rankings).
A major branch of social choice theory is devoted to the comparison of electoral systems, otherwise known as social choice functions. Viewed from the perspective of political science, electoral systems are rules for conducting elections and determining winners from the ballots cast. From the perspective of economics, mathematics, and philosophy, a social choice function is a mathematical function that determines how a society should make choices, given a collection of individual preferences.
Combinatorial participatory budgeting, also called indivisible participatory budgeting or budgeted social choice, is a problem in social choice. There are several candidate projects, each of which has a fixed costs. There is a fixed budget, that cannot cover all these projects. Each voter has different preferences regarding these projects. The goal is to find a budget-allocation - a subset of the projects, with total cost at most the budget, that will be funded. Combinatorial participatory budgeting is the most common form of participatory budgeting.
A jury theorem is a mathematical theorem proving that, under certain assumptions, a decision attained using majority voting in a large group is more likely to be correct than a decision attained by a single expert. It serves as a formal argument for the idea of wisdom of the crowd, for decision of questions of fact by jury trial, and for democracy in general.
Justified representation (JR) is a criterion of fairness in multiwinner approval voting. It can be seen as an adaptation of the proportional representation criterion to approval voting.
Fractional, stochastic, or weighted social choice is a branch of social choice theory in which the collective decision is not a single alternative, but rather a weighted sum of two or more alternatives. For example, if society has to choose between three candidates, then in standard social choice exactly one of these candidates is chosen. By contrast, in fractional social choice it is possible to choose any linear combination of these, e.g. "2/3 of A and 1/3 of B".
In political science and social choice theory, the spatialmodel of voting is a mathematical model of voting behavior. It describes voters and candidates as varying along one or more axes, where each axis represents an attribute of the candidate that voters care about. Voters are modeled as having an ideal point in this space, and preferring candidates closer to this point over those who are further away; these kinds of preferences are called single-peaked.
Multi-issue voting is a setting in which several issues have to be decided by voting. Multi-issue voting raises several considerations, that are not relevant in single-issue voting.
Budget-proposal aggregation (BPA) is a problem in social choice theory. A group has to decide on how to distribute its budget among several issues. Each group-member has a different idea about what the ideal budget-distribution should be. The problem is how to aggregate the different opinions into a single budget-distribution program.
Participatory budgeting experiments are experiments done in the laboratory and in computerized simulations, in order to check various ethical and practical aspects of participatory budgeting. These experiments aim to decide on two main issues:
Belief aggregation, also called risk aggregation,opinion aggregation or probabilistic opinion pooling, is a process in which different probability distributions, produced by different experts, are combined to yield a single probability distribution.
The median voting rule or median mechanism is a rule for group decision-making along a one-dimensional domain. Each person votes by writing down his/her ideal value, and the rule selects a single value which is the median of all votes.
This article needs additional or more specific categories .(November 2023) |