Unanimous, reducible, anonymous social choice
Antonio Quesada
Abstract
Open-access reader
Antonio Quesada
Abstract
Open-access reader
The problem of aggregating preferences over two alternatives is considered. Three axioms are postulated: unanimity, reducibility (two divergent preferences can be replaced by their aggregation), and anonymity. It is shown that only twelve aggregation rules satisfy the three axioms: the majority rule, two myopic majority rules, three dictated rules (rules that almost always output the same outcome), and six hierarchically dictated rules (the output is determined by some priority ranking among outcomes).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The problem of aggregating preferences over two alternatives is considered. Three axioms are postulated: unanimity, reducibility (two divergent preferences can be replaced by their aggregation), and anonymity. It is shown that only twelve aggregation rules satisfy the three axioms: the majority rule, two myopic majority rules, three dictated rules (rules that almost always output the same outcome), and six hierarchically dictated rules (the output is determined by some priority ranking among outcomes).
Key concepts: Unanimity, Axiom, Anonymity, Social choice theory, Outcome (game theory), Ranking (information retrieval), Mathematical economics, Majority rule