Intrinsic Limitations of the Majority Rule, an Algorithmic Approach

DOI10.1137/0606013MaRDI QIDQ3682189zbMATH OpenOpenAlexFDO

Authors James Abello

Publication date 1985

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0606013

zbMATH Keywords

Blackian domainconnected graphsconsistent sets of permutationsgraph theoretical techniquesmajority rulemajority votemaximal consistent sets

Mathematics Subject Classification ID

Social choice (91B14)

Recommendations

• scientific article; zbMATH DE number 4043899
• How Large are Transitive Simple Majority Domains?
• Majority-consistent preference orderings
• Triple-consistent social choice and the majority rule
• What majority decisions are possible

Cites work

• Conditions on preferences that guarantee a simple majority winner†
• How Large are Transitive Simple Majority Domains?
• Social choice and individual values
• The extended Condorcet condition: A necessary and sufficient condition for the transitivity of majority decision
• The Simple Majority Decision Rule
• Voting Anomalies, the Number of Voters, and the Number of Alternatives

Cited in

(9)

• Omnipotence in stretchable two-dimensional scaling
• Majority-consistent preference orderings
• A note on restricted majority rules: Invariance to rule selection and outcome distinctiveness
• How Large are Transitive Simple Majority Domains?
• scientific article; zbMATH DE number 4147800 (Why is no real title available?)
• scientific article; zbMATH DE number 4043899 (Why is no real title available?)
• The capacity of majority rule
• The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
• An extension of McGarvey's theorem from the perspective of the plurality collective choice mechanism

This page was built for publication: Intrinsic Limitations of the Majority Rule, an Algorithmic Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682189)