A joint Politics and Economics series |
Social choice and electoral systems |
---|
Mathematicsportal |
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 theorem was first set out by Duncan Black in 1948. [1] He wrote that he saw a large gap in economic theory concerning how voting determines the outcome of decisions, including political decisions. Black's paper triggered research on how economics can explain voting systems. In 1957 Anthony Downs expounded upon the median voter theorem in his book An Economic Theory of Democracy. [2]
A related assertion was made earlier (in 1929) by Harold Hotelling, who argued politicians in a representative democracy would converge to the viewpoint of the median voter, [3] basing this on his model of economic competition. [3] [4] However, this assertion relies on a deeply simplified voting model, and is only partly applicable to systems satisfying the median voter property. It cannot be applied to systems like ranked choice voting (RCV) or first-past-the-post at all, even in two-party systems. [5] [6] [note 1]
The median voter theorem says that in dimensional elections, the candidate closest to the median voter is the majority-preferred (Condorcet) candidate, i.e. a candidate who a majority of voters prefer to every other candidate.
In a "one-dimensional" election, where the opinions of candidates and voters are distributed along a one-dimensional spectrum and a voter ranks candidates by proximity, such that the candidate closest to the voter receives their first preference, the next closest receives their second preference, and so forth, the median voter theorem says that "C," the candidate closest in views to the median voter "M," will be the Condorcet winner of any election conducted using a method satisfying the Condorcet criterion. In particular, when there are only two candidates, a majority rule system satisfies the Condorcet criterion; for multi-candidate votes, several methods satisfy it.
Proof sketch: Let the median voter be Marlene. The candidate who is closest to her will receive her first preference vote. Suppose that this candidate is Charles and that he lies to her left. Marlene and all voters to her left (by definition a majority of the electorate) will prefer Charles to all candidates to his right, and Marlene and all voters to her right (also a majority) will prefer Charles to all candidates to his left. ◻
We will say that a voting method has the "median voter property in one dimension" if it always elects the candidate closest to the median voter under a one-dimensional spatial model. We may summarize the median voter theorem as saying that all Condorcet methods possess the median voter property in one dimension.
It turns out that Condorcet methods are not unique in this: Coombs' method is not Condorcet-consistent but nonetheless satisfies the median voter property in one dimension. [9] Approval voting satisfies the same property under several models of strategic voting.
It is impossible to fully generalize the median voter theorem to spatial models in more than one dimension, as there is no longer a single unique "median" for all possible distributions of voters. However, it is still possible to demonstrate similar theorems under some limited conditions.
Ranking | Votes |
---|---|
A-B-C | 30 |
B-A-C | 29 |
C-A-B | 10 |
B-C-A | 10 |
A-C-B | 1 |
C-B-A | 1 |
Number of voters | |
---|---|
A > B | 41:40 |
A > C | 60:21 |
B > C | 69:12 |
Total | 81 |
The table shows an example of an election given by the Marquis de Condorcet, who concluded it showed a problem with the Borda count. [10] : 90 The Condorcet winner on the left is A, who is preferred to B by 41:40 and to C by 60:21. The Borda winner is instead B. However, Donald Saari constructs an example in two dimensions where the Borda count (but not the Condorcet winner) correctly identifies the candidate closest to the center (as determined by the geometric median). [11]
The diagram shows a possible configuration of the voters and candidates consistent with the ballots, with the voters positioned on the circumference of a unit circle. In this case, A's mean absolute deviation is 1.15, whereas B's is 1.09 (and C's is 1.70), making B the spatial winner.
Thus the election is ambiguous in that two different spatial representations imply two different optimal winners. This is the ambiguity we sought to avoid earlier by adopting a median metric for spatial models; but although the median metric achieves its aim in a single dimension, the property does not fully generalize to higher dimensions.
Despite this result, the median voter theorem can be applied to distributions that are rotationally symmetric, e.g. Gaussians, which have a single median that is the same in all directions. Whenever the distribution of voters has a unique median in all directions, and voters rank candidates in order of proximity, the median voter theorem applies: the candidate closest to the median will have a majority preference over all his or her rivals, and will be elected by any voting method satisfying the median voter property in one dimension. [12]
It follows that all median voter methods satisfy the same property in spaces of any dimension, for voter distributions with omnidirectional medians.
It is easy to construct voter distributions which do not have a median in all directions. The simplest example consists of a distribution limited to 3 points not lying in a straight line, such as 1, 2 and 3 in the second diagram. Each voter location coincides with the median under a certain set of one-dimensional projections. If A, B and C are the candidates, then '1' will vote A-B-C, '2' will vote B-C-A, and '3' will vote C-A-B, giving a Condorcet cycle. This is the subject of the McKelvey–Schofield theorem.
Proof. See the diagram, in which the grey disc represents the voter distribution as uniform over a circle and M is the median in all directions. Let A and B be two candidates, of whom A is the closer to the median. Then the voters who rank A above B are precisely the ones to the left (i.e. the 'A' side) of the solid red line; and since A is closer than B to M, the median is also to the left of this line.
Now, since M is a median in all directions, it coincides with the one-dimensional median in the particular case of the direction shown by the blue arrow, which is perpendicular to the solid red line. Thus if we draw a broken red line through M, perpendicular to the blue arrow, then we can say that half the voters lie to the left of this line. But since this line is itself to the left of the solid red line, it follows that more than half of the voters will rank A above B.
Whenever a unique omnidirectional median exists, it determines the result of Condorcet voting methods. At the same time the geometric median can arguably be identified as the ideal winner of a ranked preference election. It is therefore important to know the relationship between the two. In fact whenever a median in all directions exists (at least for the case of discrete distributions), it coincides with the geometric median.
Lemma. Whenever a discrete distribution has a median M in all directions, the data points not located at M must come in balanced pairs (A,A ' ) on either side of M with the property that A – M – A ' is a straight line (ie. not like A 0 – M – A 2 in the diagram).
Proof. This result was proved algebraically by Charles Plott in 1967. [13] Here we give a simple geometric proof by contradiction in two dimensions.
Suppose, on the contrary, that there is a set of points Ai which have M as median in all directions, but for which the points not coincident with M do not come in balanced pairs. Then we may remove from this set any points at M, and any balanced pairs about M, without M ceasing to be a median in any direction; so M remains an omnidirectional median.
If the number of remaining points is odd, then we can easily draw a line through M such that the majority of points lie on one side of it, contradicting the median property of M.
If the number is even, say 2n, then we can label the points A 0, A1,... in clockwise order about M starting at any point (see the diagram). Let θ be the angle subtended by the arc from M –A 0 to M –A n . Then if θ < 180° as shown, we can draw a line similar to the broken red line through M which has the majority of data points on one side of it, again contradicting the median property of M ; whereas if θ > 180° the same applies with the majority of points on the other side. And if θ = 180°, then A 0 and A n form a balanced pair, contradicting another assumption.
Theorem. Whenever a discrete distribution has a median M in all directions, it coincides with its geometric median.
Proof. The sum of distances from any point P to a set of data points in balanced pairs (A,A ' ) is the sum of the lengths A – P – A '. Each individual length of this form is minimized over P when the line is straight, as happens when P coincides with M. The sum of distances from P to any data points located at M is likewise minimized when P and M coincide. Thus the sum of distances from the data points to P is minimized when P coincides with M.
A related observation was discussed by Harold Hotelling as his 'principle of minimum differentiation', also known as 'Hotelling's law'. It states that if:
Then all politicians will converge to the median voter. As a special case, this law applies to the situation where there are exactly two candidates in the race, if it is impossible or implausible that any more candidates will join the race, because a simple majority vote between two alternatives satisfies the Condorcet criterion.
This theorem was first described by Hotelling in 1929. [4] In practice, none of these conditions hold for modern American elections, though they may have held in Hotelling's time (when nominees were publicly-unknown candidates chosen by closed party caucuses in ideologically diverse parties). Most importantly, politicians must win primary elections, which often include challengers or competitors, to be chosen as major-party nominees. As a result, politicians must compromise between appealing to the median voter in the primary and general electorates. Similar effects imply candidates do not converge to the median voter under electoral systems that do not satisfy the median voter theorem, including plurality voting, plurality-with-primaries, plurality-with-runoff, or ranked-choice runoff (RCV). [5] [14]
The theorem is valuable for the light it sheds on the optimality (and the limits to the optimality) of certain voting systems.
Valerio Dotti points out broader areas of application:
The Median Voter Theorem proved extremely popular in the Political Economy literature. The main reason is that it can be adopted to derive testable implications about the relationship between some characteristics of the voting population and the policy outcome, abstracting from other features of the political process. [12]
He adds that...
The median voter result has been applied to an incredible variety of questions. Examples are the analysis of the relationship between income inequality and size of governmental intervention in redistributive policies (Meltzer and Richard, 1981), [15] the study of the determinants of immigration policies (Razin and Sadka, 1999), [16] of the extent of taxation on different types of income (Bassetto and Benhabib, 2006), [17] and many more.
In social choice theory, Condorcet's voting paradox is a fundamental discovery by the Marquis de Condorcet that majority rule is inherently self-contradictory. The result implies that it is logically impossible for any voting system to guarantee a winner will have support from a majority of voters: in some situations, a majority of voters will prefer A to B, B to C, and also C to A, even if every voter's individual preferences are rational and avoid self-contradiction. Examples of Condorcet's paradox are called Condorcet cycles or cyclic ties.
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 or Pairwise Majority Rule Winner (PMRW). 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 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 Copeland or Llull method is a ranked-choice voting system based on counting each candidate's pairwise wins and losses.
Independence of irrelevant alternatives (IIA) is an axiom of decision theory which codifies the intuition that a choice between and should not depend on the quality of a third, unrelated outcome . There are several different variations of this axiom, which are generally equivalent under mild conditions. As a result of its importance, the axiom has been independently rediscovered in various forms across a wide variety of fields, including economics, cognitive science, social choice, fair division, rational choice, artificial intelligence, probability, and game theory. It is closely tied to many of the most important theorems in these fields, including Arrow's impossibility theorem, the Balinski-Young theorem, and the money pump arguments.
In social choice theory, May's theorem, also called the general possibility theorem, says that majority vote is the unique ranked social choice function between two candidates that satisfies the following criteria:
A Condorcet winner is a candidate who would receive the support of more than half of the electorate in a one-on-one race against any one of their opponents. Voting systems where a majority winner will always win are said to satisfy the Condorcet winner criterion. The Condorcet winner criterion extends the principle of majority rule to elections with multiple candidates.
In social choice, a no-show paradox is a pathology in some voting rules, where a candidate loses an election as a result of having too many supporters. More formally, a no-show paradox occurs when adding voters who prefer Alice to Bob causes Alice to lose the election to Bob. Voting systems without the no-show paradox are said to satisfy the participation criterion.
The majority criterion is a winner-takes-all voting system criterion that says that, if only one candidate is ranked first by over 50% of voters, that candidate must win.
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.
Later-no-harm is a property of some ranked-choice voting systems, first described by Douglas Woodall. In later-no-harm systems, increasing the rating or rank of a candidate ranked below the winner of an election cannot cause a higher-ranked candidate to lose. It is a common property in the plurality-rule family of voting systems.
The Borda method or order of merit is a positional voting rule which gives each candidate a number of points equal to the number of candidates ranked below them: the lowest-ranked candidate gets 0 points, the second-lowest gets 1 point, and so on. Once all votes have been counted, the option or candidate with the most points is the winner.
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.
Ranked voting is any voting system that uses voters' rankings of candidates to choose a single winner or multiple winners. More formally, a ranked system is one that depends only on which of two candidates is preferred by a voter, and as such does not incorporate any information about intensity of preferences. Ranked voting systems vary dramatically in how preferences are tabulated and counted, which gives them very different properties.
There are a number of different criteria which can be used for voting systems in an election, including the following
The McKelvey–Schofield chaos theorem is a result in social choice theory. It states that if preferences are defined over a multidimensional policy space, then choosing policies using majority rule is unstable. There will in most cases be no Condorcet winner and any policy can be enacted through a sequence of votes, regardless of the original policy. This means that adding more policies and changing the order of votes can be used to arbitrarily pick the winner.
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.
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".
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.
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.