McGarvey's theorem: Difference between revisions
Content added Content deleted
(Created page with "McGarvey's theorem <ref>https://www.researchgate.net/publication/243774148_A_Theorem_on_the_Construction_of_Voting_Paradoxes</ref> proves that majority rule can result in any...") |
No edit summary |
||
| Line 1: | Line 1: | ||
McGarvey's theorem <ref>https://www.researchgate.net/publication/243774148_A_Theorem_on_the_Construction_of_Voting_Paradoxes</ref> proves that majority rule can result in any kind of societal preference ordering among the candidates. Sometimes it is called McGarvey's method. |
McGarvey's theorem <ref>https://www.researchgate.net/publication/243774148_A_Theorem_on_the_Construction_of_Voting_Paradoxes</ref> proves that majority rule can result in any kind of societal preference ordering among the candidates. Sometimes it is called McGarvey's method. |
||
It is often cited and used when discussing pairwise majority rule in order to construct examples with various types of preference orderings. |
It is often cited and used when discussing pairwise majority rule in order to construct examples with various types of preference orderings resulting in various kinds of social preference orders (i.e. [[order of finish|orders of finish]]). |
||
[[Category:Majority-related concepts]] |
|||
Revision as of 05:15, 23 March 2020
McGarvey's theorem [1] proves that majority rule can result in any kind of societal preference ordering among the candidates. Sometimes it is called McGarvey's method.
It is often cited and used when discussing pairwise majority rule in order to construct examples with various types of preference orderings resulting in various kinds of social preference orders (i.e. orders of finish).