Matches in DBpedia 2014 for { <http://dbpedia.org/resource/May's_theorem> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- May's_theorem abstract "In social choice theory, May's theorem states that simple majority voting is the only anonymous, neutral, and positively responsive social choice function between two alternatives. Further, this procedure is resolute when there are an odd number of voters and ties (indecision) are not allowed. Kenneth May first published this theory in 1952.Various modifications have been suggested by others since the original publication. Mark Fey extended the proof to an infinite number of voters. Robert Goodin and Christian List showed that, among methods of aggregating first-preference votes over multiple alternatives, plurality rule uniquely satisfies May's conditions; under approval balloting, a similar statement can be made about approval voting.Arrow's theorem in particular does not apply to the case of two candidates, so this possibility result can be seen as a mirror analogue of that theorem. (Note that anonymity is a stronger form of 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.".
- May's_theorem wikiPageExternalLink Logrolling.pdf.
- May's_theorem wikiPageExternalLink FeyMay.pdf.
- May's_theorem wikiPageID "719575".
- May's_theorem wikiPageRevisionID "568510711".
- May's_theorem hasPhotoCollection May's_theorem.
- May's_theorem subject Category:1952_in_science.
- May's_theorem subject Category:Social_choice_theory.
- May's_theorem subject Category:Theorems_in_discrete_mathematics.
- May's_theorem subject Category:Voting_theory.
- May's_theorem type Abstraction100002137.
- May's_theorem type Communication100033020.
- May's_theorem type Message106598915.
- May's_theorem type Proposition106750804.
- May's_theorem type Statement106722453.
- May's_theorem type Theorem106752293.
- May's_theorem type TheoremsInDiscreteMathematics.
- May's_theorem comment "In social choice theory, May's theorem states that simple majority voting is the only anonymous, neutral, and positively responsive social choice function between two alternatives. Further, this procedure is resolute when there are an odd number of voters and ties (indecision) are not allowed. Kenneth May first published this theory in 1952.Various modifications have been suggested by others since the original publication. Mark Fey extended the proof to an infinite number of voters.".
- May's_theorem label "May's theorem".
- May's_theorem label "Teorema de May".
- May's_theorem label "Teorema di May".
- May's_theorem label "Twierdzenie Maya".
- May's_theorem label "メイの定理".
- May's_theorem sameAs Teorema_de_May.
- May's_theorem sameAs Teorema_di_May.
- May's_theorem sameAs メイの定理.
- May's_theorem sameAs Twierdzenie_Maya.
- May's_theorem sameAs m.035l0x.
- May's_theorem sameAs Q1056283.
- May's_theorem sameAs Q1056283.
- May's_theorem sameAs May's_theorem.
- May's_theorem wasDerivedFrom May's_theorem?oldid=568510711.
- May's_theorem isPrimaryTopicOf May's_theorem.