Graduated majority judgment

Last updated

Graduated majority judgment (GMJ), sometimes called the usual judgment or continuous Bucklin voting , is a single-winner electoral system. It was invented independently three times in the early 21st century. It was first suggested as an improvement on majority judgment by Andrew Jennings in 2010, [1] then by Jameson Quinn,[ citation needed ] and later independently by the French social scientist Adrien Fabre in 2019. [2] In 2024, the latter coined the name "median judgment" for the rule, arguing it was the best highest median voting rule [3] .

Contents

It is a highest median voting rule, a system of cardinal voting in which the winner is decided by the median rating rather than the mean. [2]

GMJ begins by counting all ballots for their first choice. If no candidate has a majority then later (second, third, etc.) preferences are added to first preferences until one candidate reaches 50% of the vote. The first candidate to reach a majority of the vote is the winner.

Highest medians

Votes should be cast using a cardinal (rated) ballot, which ask voters to give each candidate a separate grade, such as :

AwfulBadTolerableNeutralAcceptableGoodExcellent
Candidate AX
Candidate BX
Candidate CX
Candidate DX

When counting the votes, we calculate the share of each grade for each of the votes cast. This is the candidate's "merit profile":

CandidateAwfulBadTolerableNeutralAcceptableGoodExcellent
A2%15%21%20%9%18%15%
B2%17%19%13%13%12%24%
C1%9%10%15%15%25%25%

For each candidate, we determine the median or majority grade as the grade where a majority of voters would oppose giving the candidate a higher grade, but a majority would also oppose giving a lower grade. [4] This rule means that the absolute majority of the electors judge that a candidates merits at least its median grade, while half the electors judge that he deserves at most its median grade. [5]

If only one candidate has the highest median grade, they are elected (as in all highest median voting rules). Otherwise, the election uses a tie-breaking procedure.

Tie-breaking

Graduated majority judgment uses a simple line-drawing method to break ties. [2] This rule is easier to explain than others such as majority judgment, and also guarantees continuity.

Graphically, we can represent this by drawing a plot showing the share of voters who assign an approval less than the given score, then draw lines connecting the points on this graph. The place where this plot intersects 50% is each candidate's score.

Example

Consider the same election as before, but relabeling the verbal grades as numbers on a scale from 0 to 6:

A plot showing how the overall score of a candidate can be calculated using graduated majority judgment. GMJ-tiebreaker.svg
A plot showing how the overall score of a candidate can be calculated using graduated majority judgment.
Grade
Candidate
0123456
A

(Running total)

2%15%21%20%9%18%15%
2%17%39%58%68%85%100%
B

(Running total)

2%17%19%13%13%12%24%
2%19%38%51%64%76%100%
C

(Running total)

1%9%10%15%15%25%25%
1%10%20%35%50%75%100%

Candidates A and B both cross the 50% threshold between 2 or 3, so we must invoke the tiebreaking procedure. When we do, we find that the median grades for candidates A, B, and C are 3.4, 3.1, and 2.0 respectively. Thus, Candidate A is declared the winner.

Race analogy

The tiebreaking rule can be explained using an analogy where every candidate is in a race. Each candidate takes 1 minute to run from one grade to the next, and they run at a constant speed when moving from one grade to the next. The winner is the first candidate to cross the finish line at 50% of the vote.

Mathematical formula

Say the median grade of a candidate is (when there is a tie, we define the median as halfway between the neighboring grades). Let (the share of proponents) refer to the share of electors giving a score strictly better than the median grade. The share of opponents of , written , is the share of grades falling below the median. Then the complete score for GMJ is given by the following formula: [2]

Additional tie-breaking

In the unusual case of a tie where the formula above does not determine a single winner (if several candidates have exactly the same score), ties can be broken by binning together the 3 grades closest to the median, then repeating the tie-breaking procedure. [2] In the example above, we would combine all "Good," "Fair," and "Passable" grades into a new "Passable to Good" grade, then apply the same tie-breaking formula as before. This process can be repeated multiple times (binning more and more grades) until a winner is found.

Properties and advantages

Advantages and disadvantages common to highest-median rules

As an electoral system, the graduated majority judgment shares most of its advantages with other highest-median voting rules such as majority judgment, including its resistance to tactical voting. It also shares most of its disadvantages (for example, it fails the participation criterion, and can fail the majority criterion arbitrarily badly).

Specific advantages of graduated majority judgment

The tie-breaking formula of the graduated majority judgment presents specific advantages over the other highest-median voting rules.

Continuity

The function defined by the graduated majority judgment tie-breaking formula is a continuous function (as well as being almost-everywhere differentiable), whereas the functions of majority judgment and typical judgment are discontinuous. [2] In other words, a small change in the number of votes for each candidate is unlikely to change the winner of the election, because small changes in vote shares result in only small changes in the overall rating.

This property makes the graduated majority judgment a more robust voting method in the face of accusations of fraud or demands of a recount of all votes. As small differences of votes are less likely to change the outcome of the election, candidates are less likely to contest results. [2]

Rare ties

The additional tie-breaking procedures of graduated majority judgment mean that tied elections become extremely unlikely (far less likely than systems such as plurality). Whereas plurality votes, ranked voting, and approval voting can result in ties when working with small elections, the only way for two candidates to tie with usual judgment is to have all candidates receive exactly the same number of votes in every grade category, implying the chances of an undetermined election fall exponentially with the number of grades.

See also

Related Research Articles

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.

<span class="mw-page-title-main">Condorcet method</span> Pairwise-comparison electoral system

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 celebrated result and key impossibility theorem in social choice theory. It shows that no ranked-choice voting rule can produce a logically coherent ranking of candidates. Specifically, no such procedure can satisfy a key criterion of decision theory, called independence of irrelevant alternatives or independence of spoilers: that the choice between and should not depend on the quality of a third, unrelated outcome .

In the study of electoral systems, the Droop quota is the minimum number of votes needed for a party or candidate to guarantee themselves one extra seat in a legislature. It generalizes the concept of a majority to multiple-winner elections: just as a majority guarantees a candidate can be declared the winner of a one-on-one election, having more than one Droop quota's worth of votes measures the number of votes a candidate needs to be guaranteed victory in a multiwinner election.

Bucklin voting is a class of voting methods that can be used for single-member and multi-member districts. As in highest median rules like the majority judgment, the Bucklin winner will be one of the candidates with the highest median ranking or rating. It is named after its original promoter, the Georgist politician James W. Bucklin of Grand Junction, Colorado, and is also known as the Grand Junction system.

The Schulze method is an electoral system developed in 1997 by Markus Schulze that selects a single winner using votes that express preferences. The method can also be used to create a sorted list of winners. The Schulze method is also known as Schwartz Sequential dropping (SSD), cloneproof Schwartz sequential dropping (CSSD), the beatpath method, beatpath winner, path voting, and path winner. The Schulze method is a Condorcet method, which means that if there is a candidate who is preferred by a majority over every other candidate in pairwise comparisons, then this candidate will be the winner when the Schulze method is applied.

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 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."

A voting system satisfies join-consistency if combining two sets of votes, both electing A over B, always results in a combined electorate that ranks A over B. It is a stronger form of the participation criterion, which only requires join-consistency when one of the sets of votes unanimously prefers A over B.

The single transferable vote (STV) is a proportional representation voting system that elects multiple winners. It is one of several ways of choosing winners from ballots that rank candidates by preference. Under STV, an elector's vote is initially allocated to their 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. if no surplus votes have to be transferred, then the least-popular candidate is eliminated so the vote has chance to be placed on a candidate who can use it.

In single-winner voting system theory, the Condorcet loser criterion (CLC) is a measure for differentiating voting systems. It implies the majority loser criterion but does not imply the Condorcet winner criterion.

Reversal symmetry is a voting system criterion which requires that if candidate A is the unique winner, and each voter's individual preferences are inverted, then A must not be elected. Methods that satisfy reversal symmetry include Borda count, ranked pairs, Kemeny–Young method, and Schulze method. Methods that fail include Bucklin voting, instant-runoff voting and Condorcet methods that fail the Condorcet loser criterion such as Minimax.

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.

The Oklahoma primary electoral system was a voting system used to elect one winner from a pool of candidates using preferential voting. Voters rank candidates in order of preference, and their votes are initially allocated to their first-choice candidate. If, after this initial count, no candidate has a majority of votes cast, a mathematical formula comes into play. The system was used for primary elections in Oklahoma when it was adopted in 1925 until it was ruled unconstitutional by the Supreme Court of Oklahoma in 1926.

Majority judgment (MJ) is a single-winner voting system proposed in 2010 by Michel Balinski and Rida Laraki. It is a kind of highest median rule, a cardinal voting system that elects the candidate with the highest median rating.

<span class="mw-page-title-main">Rated voting</span> Electoral systems with independent candidate ratings

Rated 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 cardinal, evaluative, or graded voting systems. Cardinal methods and ordinal methods are the two modern categories of voting systems.

<span class="mw-page-title-main">Ranked voting</span> Family of electoral systems

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.

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.

The highest median voting rules are a class of graded voting rules where the candidate with the highest median rating is elected.

References

  1. Jennings, Andrew (2010). Monotonicity and Manipulability of Ordinal and Cardinal Social Choice Functions (PDF). Arizona State University. pp. 25–30.{{cite book}}: CS1 maint: date and year (link)
  2. 1 2 3 4 5 6 7 Fabre, Adrien (2021). "Tie-breaking the highest median: alternatives to the majority judgment". Social Choice and Welfare. 56: 101–124. doi:10.1007/s00355-020-01269-9. S2CID   226196615 via Springer Link.
  3. Fabre, Adrien. "I propose to coin the term MEDIAN JUDGMENT for a voting rule that is known both as the "usual judgment" and the "graduated majority judgment". I have just had an Aha moment: this rule deserves the title of the best highest-median voting rule. Let me explain why". X.
  4. "Le jugement majoritaire". lechoixcommun.fr (in French). Retrieved 2021-02-08.
  5. Leray, Marjolaine; Hogg, Carol. "A little more democracy? Cartoons by Marjolaine Leray on the topic of Majority Judgment" (PDF). Le Choix commun.