Misplaced Pages

Simple majority voting: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editContent deleted Content addedVisualWikitext
Revision as of 02:00, 12 October 2008 editSmackBot (talk | contribs)3,734,324 editsm Date maintenance tags and general fixes← Previous edit Latest revision as of 21:20, 11 November 2008 edit undoSgtSchumann (talk | contribs)324 edits Made redirect, as discussed on Talk
Line 1: Line 1:
#REDIRECT ]
{{Merge|Majority rule|date=October 2008}}
{{Confusing|date=August 2008}}
{{Refimprove|date=October 2008}}

{{Electoral systems}}
'''Simple majority voting''' is a form of ] where, given two options, the option receiving more votes than the other wins. This contrasts with ] voting, where the winner is the option which gets more than half of all possible votes, including abstentions.

As well as being used in formal voting, simple majority voting is informally used in small groups to make all kinds of practical decisions, such as by counting hands in a group or judging the loudness of the cheers in a crowd.

==May's theorem==
] states that ] is the unique rule that satisfies the conditions of
anonymity, neutrality, and positive responsiveness with a finite number of
voters.{{ref|May}}{{ref|Fey}}

==Manipulability by voters==

Manipulability by voters is as such unobservable, but doesn’t constitute a problem with simple majority voting, since in a two option case, it is impossible to manipulate the result by voting strategically. May states that, since group choice must depend only upon individual preferences concerning the alternatives in a set, a pattern of group choice may be built up if we know the group preference for each pair of alternatives. However, manipulability in a many-options case is not as simple as it sounds.{{Fact|date=October 2008}}

==Properties==
Simple majority voting satisfies the ]: it assigns an unambiguous value to every logically possible list of individual preferences. In other words, whatever every individual chooses, the procedure always yields a result. This trait is sometimes referred to as decisiveness.

Secondly, simple majority voting satisfies ]: it assigns the same value to two lists that are permutations of one another. This means that when two people change their votes in such a way that the number of voters for each option remains the same, than the result remains the same. The procedure does not care about which voter votes for an option, only about how many voters vote for that option. If the result changed, that would mean that one of those two votes overrides all the other votes, which comes down to a dictatorship.

Simple majority voting also satisfies ]: if everyone reverses their vote, the result is reversed, a tie remains a tie.

As fourth and last property, simple majority voting satisfies ]. If one of the two options has more or equally many votes as the other option and one voter changes his mind in favor of that first option, then the result will also change in favor of that option: a tie becomes a win and a win stays a win.

==References==
#{{note|May}}May, Kenneth O. 1952. "A set of independent necessary and sufficient conditions for simple majority decisions", ''Econometrica'', Vol. 20, Issue 4, pp. 680–684.
#{{note|Fey}}Mark Fey, "", ''Social Choice and Welfare'', 2004, Vol. 23, issue 2, pages 275–293.

==See also==
* ]
* ]

]

Latest revision as of 21:20, 11 November 2008

Redirect to: