Approval voting is an electoral system in which voters can select any number of candidates instead of selecting only one.
Score voting or range voting is an electoral system for single-seat elections, in which voters give each candidate a score, the scores are added, and the candidate with the highest total is elected. It has been described by various other names including evaluative voting, utilitarian voting, interval measure voting, point-sum voting, ratings summation, 0-99 voting, and average voting. It is a type of cardinal voting electoral system that aims to approximate the utilitarian social choice rule.
In social choice theory, a Condorcet paradox is a situation where majority rule behaves in a way that is self-contradictory. In such a situation, every possible choice is rejected by the electorate in favor of another, because there is always some other outcome that a majority of voters consider to be better.
A Condorcet method is an election method that elects the candidate who wins a majority of the vote in every head-to-head election against each of the other candidates, whenever there is such a candidate. A candidate with this property, the pairwise champion or beats-all winner, is formally called the Condorcet winner. The head-to-head elections need not be done separately; a voter's choice within any given pair can be determined from the ranking.
Arrow's impossibility theorem is a key impossibility theorem in social choice theory. It shows that no ranked voting rule can produce a logically coherent ranking in elections with more than two candidates. Specifically, no such rule can satisfy a key criterion of decision theory, called independence of irrelevant alternatives: that its choice between and should not depend on the quality of a third, unrelated outcome .
The Smith set, also known as the top cycle, is a concept from the theory of electoral systems that generalizes the Condorcet winner to cases where no such winner exists, by allowing cycles of candidates to be treated jointly as if they were a single Condorcet winner. Named after John H. Smith, the Smith set is the smallest non-empty set of candidates in a particular election, such that each member defeats every candidate outside the set in a pairwise election. The Smith set provides one standard of optimal choice for an election outcome. Voting systems that always elect a candidate from the Smith set pass the Smith criterion.
Ranked pairs, sometimes called the Tideman method, is a tournament-style system of ranked-choice voting first proposed by Nicolaus Tideman in 1987.
In an election, a candidate is called a Condorcet, beats-all, or majority-rule winner if more than half of voters would support them in any one-on-one matchup with another candidate. Such a candidate is also called an undefeated, or tournament champion, by analogy with round-robin tournaments. Voting systems where a majority-rule winner will always win the election are said to satisfy the Condorcetcriterion. Condorcet voting methods extend majority rule to elections with more than one candidate.
The participation criterion, also called vote or population monotonicity, is a voting system criterion that says that a candidate should never lose an election because they have "too much support." It says that adding voters who support A over B should not cause A to lose the election to B.
The majority criterion is a voting system criterion. The criterion states that "if only one candidate is ranked first by a majority of voters, then that candidate must win."
The Borda count electoral system can be combined with an instant-runoff procedure to create hybrid election methods that are called Nanson method and Baldwin method. Both methods are designed to satisfy the Condorcet criterion, and allow for incomplete ballots and equal rankings.
The Kemeny–Young method is an electoral system that uses ranked ballots and pairwise comparison counts to identify the most popular choices in an election. It is a Condorcet method because if there is a Condorcet winner, it will always be ranked as the most popular choice.
The later-no-harm criterion is a voting system criterion first formulated by Douglas Woodall. Woodall defined the criterion by saying that "[a]dding a later preference to a ballot should not harm any candidate already listed." For example, a ranked voting method in which a voter adding a 3rd preference could reduce the likelihood of their 1st preference being selected, fails later-no-harm.
The Borda count is a family of positional voting rules which gives each candidate, for each ballot, a number of points corresponding to the number of candidates ranked lower. In the original variant, the lowest-ranked candidate gets 0 points, the next-lowest gets 1 point, etc., and the highest-ranked candidate gets n − 1 points, where n is the number of candidates. Once all votes have been counted, the option or candidate with the most points is the winner. The Borda count is intended to elect broadly acceptable options or candidates, rather than those preferred by a majority, and so is often described as a consensus-based voting system rather than a majoritarian one.
Instant-runoff voting (IRV), also known as plurality with elimination or plurality loser, is a ranked-choice voting system that modifies plurality by repeatedly eliminating the last-place winner until only one candidate is left. In the United Kingdom, it is generally called the alternative vote (AV). In the United States, IRV is often referred to as ranked-choice voting (RCV), by way of conflation with ranked voting systems in general.
The term ranked voting, also known as preferential voting or ranked-choice voting, pertains to any voting system where voters indicate a rank to order candidates or options—in a sequence from first, second, third, and onwards—on their ballots. Ranked voting systems vary based on the ballot marking process, how preferences are tabulated and counted, the number of seats available for election, and whether voters are allowed to rank candidates equally.
The later-no-help criterion is a voting system criterion formulated by Douglas Woodall. The criterion is satisfied if, in any election, a voter giving an additional ranking or positive rating to a less-preferred candidate can not cause a more-preferred candidate to win. Voting systems that fail the later-no-help criterion are vulnerable to the tactical voting strategy called mischief voting, which can deny victory to a sincere Condorcet winner.
Computational social choice is a field at the intersection of social choice theory, theoretical computer science, and the analysis of multi-agent systems. It consists of the analysis of problems arising from the aggregation of preferences of a group of agents from a computational perspective. In particular, computational social choice is concerned with the efficient computation of outcomes of voting rules, with the computational complexity of various forms of manipulation, and issues arising from the problem of representing and eliciting preferences in combinatorial settings.
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.
Multiwinner voting, also called committee voting or committee elections, is an electoral system in which multiple candidates are elected. The number of elected candidates is usually fixed in advance. For example, it can be the number of seats in a country's parliament, or the required number of members in a committee.
Politicsportal 