Intrinsic Limitations of the Majority Rule, an Algorithmic Approach

DOI10.1137/0606013zbMath0566.90005OpenAlexW2039943575MaRDI QIDQ3682189

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

majority ruleconnected graphsmajority votemaximal consistent setsBlackian domainconsistent sets of permutationsgraph theoretical techniques

Mathematics Subject Classification ID

Social choice (91B14)

Related Items (1)

How Large are Transitive Simple Majority Domains?

Cites Work

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

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