A combinatorial proof using permutations and amplified profiles is provided for the characterization of the Baldwin rule by Neutrality, Bottom Consistency, Faithfulness, Cancellation, and Bottom Independence.
Iterative Elimination of Borda Losers: Axiomatizations of the Baldwin and Nanson Rules
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The Baldwin and Nanson rules are two voting rules proposed to identify the Condorcet winner whenever one exists. Both rules operate as recursive Borda elimination procedures: the Baldwin rule successively eliminates the alternatives with the lowest Borda score, whereas the Nanson rule eliminates all alternatives whose Borda scores do not exceed the mean. This paper investigates the axiomatic properties of the Baldwin and Nanson rules and provides unified axiomatic characterizations. In particular, our axioms are closely comparable to Young's (1974) characterization of the Borda rule.
fields
econ.TH 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Note on an Axiomatization of the Baldwin Rule
A combinatorial proof using permutations and amplified profiles is provided for the characterization of the Baldwin rule by Neutrality, Bottom Consistency, Faithfulness, Cancellation, and Bottom Independence.