Related concepts (48)
Median voter theorem
The median voter theorem is a proposition relating to ranked preference voting put forward by Duncan Black in 1948. It states that if voters and policies are distributed along a one-dimensional spectrum, with voters ranking alternatives in order of proximity, then any voting method which satisfies the Condorcet criterion will elect the candidate closest to the median voter. In particular, a majority vote between two options will do so. The theorem is associated with public choice economics and statistical political science.
Majority criterion
The majority criterion is a single-winner voting system criterion, used to compare such systems. The criterion states that "if one candidate is ranked first by a majority (more than 50%) of voters, then that candidate must win". Some methods that comply with this criterion include any Condorcet method, instant-runoff voting, Bucklin voting, and plurality voting.
Consistency criterion
A voting system is consistent if, whenever the electorate is divided (arbitrarily) into several parts and elections in those parts garner the same result, then an election of the entire electorate also garners that result. Smith calls this property separability and Woodall calls it convexity. It has been proven a ranked voting system is "consistent if and only if it is a scoring function", i.e. a positional voting system. Borda count is an example of this. The failure of the consistency criterion can be seen as an example of Simpson's paradox.
Borda count
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.
Counting single transferable votes
The single transferable vote (STV) is a proportional representation voting system that elects multiple winners based on ranked voting. Under STV, an elector's vote is initially allocated to his or her most-preferred candidate. Candidates are elected (winners) if their vote tally reaches quota. After this 1st Count, if seats still remain open, surplus votes are transferred from winners to remaining candidates (hopefuls) according to the surplus ballots' next usable back-up preference.
Copeland's method
Copeland's method is a ranked voting method based on a scoring system of pairwise "wins", "losses", and "ties". The method has a long history: Ramon Llull described the system in 1299, so it is sometimes referred to as "Llull's method" The Marquis de Condorcet described a similar system in the 1780s, so the method could be referred to as "Condorcet's method", but instead other systems were subsequently devised that choose the Condorcet winner. Arthur Herbert Copeland described the system in the 1950s, so it has been frequently been called "Copeland's method".
Electoral system
An electoral system or voting system is a set of rules that determine how elections and referendums are conducted and how their results are determined. Electoral systems are used in politics to elect governments, while non-political elections may take place in business, non-profit organisations and informal organisations. These rules govern all aspects of the voting process: when elections occur, who is allowed to vote, who can stand as a candidate, how ballots are marked and cast, how the ballots are counted, how votes translate into the election outcome, limits on campaign spending, and other factors that can affect the result.
Dodgson's method
Dodgson's method is an electoral system proposed by the author, mathematician and logician Charles Dodgson, better known as Lewis Carroll. The method is to extend the Condorcet method by swapping candidates until a Condorcet winner is found. The winner is the candidate which requires the minimum number of swaps. Dodgson proposed this voting scheme in his 1876 work "A method of taking votes on more than two issues". Given an integer k and an election, it is NP-complete to determine whether a candidate can become a Condorcet winner with fewer than k swaps.
Condorcet paradox
The Condorcet paradox (also known as the voting paradox or the paradox of voting) in social choice theory is a situation noted by the Marquis de Condorcet in the late 18th century, in which collective preferences can be cyclic, even if the preferences of individual voters are not cyclic. This is paradoxical, because it means that majority wishes can be in conflict with each other: Suppose majorities prefer, for example, candidate A over B, B over C, and yet C over A.
Cardinal voting
Cardinal voting refers to any electoral system which allows the voter to give each candidate an independent evaluation, typically a rating or grade. These are also referred to as "rated" (ratings ballot), "evaluative", "graded", or "absolute" voting systems. Cardinal methods (based on cardinal utility) and ordinal methods (based on ordinal utility) are two main categories of modern voting systems, along with plurality voting. There are several voting systems that allow independent ratings of each candidate.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.