May's theorem

Last updated

In social choice theory, May's theorem, also called the general possibility theorem, [1] says that majority vote is the unique ranked social choice function between two candidates that satisfies the following criteria:

Contents

The theorem was first published by Kenneth May in 1952.

Various modifications have been suggested by others since the original publication. If rated voting is allowed, a wide variety of rules satisfy May's conditions, including score voting or highest median voting rules.

Arrow's theorem does not apply to the case of two candidates (when there are trivially no "independent alternatives"), so this possibility result can be seen as the mirror analogue of that theorem. Note that anonymity is a stronger requirement than Arrow's non-dictatorship.

Another way of explaining the fact that simple majority voting can successfully deal with at most two alternatives is to cite Nakamura's theorem. The theorem states that the number of alternatives that a rule can deal with successfully is less than the Nakamura number of the rule. The Nakamura number of simple majority voting is 3, except in the case of four voters. Supermajority rules may have greater Nakamura numbers.[ citation needed ]

Formal statement

Let A and B be two possible choices, often called alternatives or candidates. A preference is then simply a choice of whether A, B, or neither is preferred. [1] Denote the set of preferences by {A, B, 0}, where 0 represents neither.

Let N be a positive integer. In this context, a ordinal (ranked) social choice function is a function

which aggregates individuals' preferences into a single preference. [1] An N-tuple (R1, …, RN) ∈ {A, B, 0}N of voters' preferences is called a preference profile.

Define a social choice function called simple majority voting as follows: [1]

May's theorem states that simple majority voting is the unique social welfare function satisfying all three of the following conditions: [1]

  1. Anonymity: The social choice function treats all voters the same, i.e. permuting the order of the voters does not change the result.
  2. Neutrality: The social choice function treats all outcomes the same, i.e. permuting the order of the outcomes does not change the result.
  3. Positive responsiveness: If the social choice was indifferent between A and B, but a voter who previously preferred B changes their preference to A, then the social choice is still A.

See also

Notes

  1. ^ May, Kenneth O. 1952. "A set of independent necessary and sufficient conditions for simple majority decisions", Econometrica, Vol. 20, Issue 4, pp. 680–684. JSTOR   1907651
  2. ^ Mark Fey, "May’s Theorem with an Infinite Population", Social Choice and Welfare, 2004, Vol. 23, issue 2, pages 275–293.
  3. ^ Goodin, Robert and Christian List (2006). "A conditional defense of plurality rule: generalizing May's theorem in a restricted informational environment," American Journal of Political Science, Vol. 50, issue 4, pages 940-949. doi : 10.1111/j.1540-5907.2006.00225.x

Related Research Articles

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 states that it is logically impossible for any voting system to guarantee the winner has a majority of the vote, because it is possible no such winner exists: 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.

Arrow's impossibility theorem is a key result in social choice showing that no rank-order method for collective decision-making can satisfy the requirements of rational choice. Specifically, any such rule violates independence of irrelevant alternatives, the principle that a choice between and should not depend on the quality of a third, unrelated option .

Independence of irrelevant alternatives (IIA) is a major 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.

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:

  1. The rule is dictatorial, i.e. there exists a distinguished voter who can choose the winner; or
  2. The rule limits the possible outcomes to two alternatives only; or
  3. The rule is not straightforward, i.e. there is no single always-best strategy.

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.

In social choice theory, the majority rule (MR) is a social choice rule that says that, when comparing two options, the option preferred by more than half of the voters should win.

In political science and social choice theory, Black'smedian voter theorem states that if voters and candidates are distributed along a one-dimensional spectrum and voters have single peaked preferences, any voting method satisfying the Condorcet criterion will elect the candidate preferred by the median voter.

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.

Allan Fletcher Gibbard is the Richard B. Brandt Distinguished University Professor of Philosophy Emeritus at the University of Michigan, Ann Arbor. Gibbard has made major contributions to contemporary ethical theory, in particular metaethics, where he has developed a contemporary version of non-cognitivism. He has also published articles in the philosophy of language, metaphysics, and social choice theory: in social choice, he first proved the result known today as Gibbard-Satterthwaite theorem, which had been previously conjectured by Michael Dummett and Robin Farquharson.

<span class="mw-page-title-main">Social Choice and Individual Values</span>

Kenneth Arrow's monograph Social Choice and Individual Values and a theorem within it created modern social choice theory, a rigorous melding of social ethics and voting theory with an economic flavor. Somewhat formally, the "social choice" in the title refers to Arrow's representation of how social values from the set of individual orderings would be implemented under the constitution. Less formally, each social choice corresponds to the feasible set of laws passed by a "vote" under the constitution even if not every individual voted in favor of all the laws.

The Duggan–Schwartz theorem is a result about voting systems designed to choose a nonempty set of winners from the preferences of certain individuals, where each individual ranks all candidates in order of preference. It states that for three or more candidates, at least one of the following must hold:

  1. The system is not anonymous.
  2. The system is imposed.
  3. Every voter's top preference is in the set of winners.
  4. The system can be manipulated by either an optimistic voter, one who can cast a ballot that would elect some candidate to a higher rank than all of those candidates who would have been elected if that voter had voted honestly; or by a pessimistic voter, one who can cast a ballot that would exclude some candidate to a lower rank than all of those candidates who were elected due that voter voting strategically.

In social choice theory, a dictatorship mechanism is a degenerate voting rule or mechanism where the result depends on only one person's preferences, without considering any other voters. A serial dictatorship is similar, but also designates a series of "backup dictators", who break ties in the original dictator's choices when the dictator is indifferent.

In cooperative game theory and social choice theory, the Nakamura number measures the degree of rationality of preference aggregation rules, such as voting rules. It is an indicator of the extent to which an aggregation rule can yield well-defined choices.

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

Rated, evaluative, graded, or cardinalvotingsystems are a class of voting methods which allow voters to state how strongly they support a candidate, which involves giving each one a grade on a separate scale. Cardinal methods and ordinal methods are the two categories of modern voting systems.

<span class="mw-page-title-main">Ranked voting</span> Voting systems that use ranked ballots

Ranked voting is any voting system that uses voters' orderings (rankings) of candidates to choose a single winner or multiple winners. Many ranked voting systems apply lower preferences just as contingency choices when higher preferences are found to be ineffective or the vote or part thereof needs to be transferred on in cases where higher preference was elected.

<span class="mw-page-title-main">Arunava Sen</span> Indian researcher and teacher

Arunava Sen is a professor of economics at the Indian Statistical Institute. He works on Game Theory, Social Choice Theory, Mechanism Design, Voting and Auctions.

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.

In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. It states that for any deterministic process of collective decision, at least one of the following three properties must hold:

  1. The process is dictatorial, i.e. there is a single voter whose vote chooses the outcome.
  2. The process limits the possible outcomes to two options only.
  3. The process is not straightforward; the optimal ballot for a voter "requires strategic voting", i.e. it depends on their beliefs about other voters' ballots.

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 social choice theory, a function satisfies voter anonymity, neutrality, or symmetry if the rule does not discriminate between different voters ahead of time; in other words, it does not matter who casts which vote. Formally, this is defined as saying the rule returns the same outcome if the vector of votes is permuted arbitrarily.

References

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.