The Borda dictionary

DOI10.1007/BF01376279MaRDI QIDQ808973zbMATH OpenFDO

Authors Donald G. Saari

Publication date 1990

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01376279

zbMATH Keywords

axiomatic representations of social choice functionsBorda countBorda dictionaryBorda election rankingpositional voting methodsprofile of voters

Mathematics Subject Classification ID

Voting theory (91B12) Social choice (91B14)

Recommendations

• A dictionary for voting paradoxes
• The Borda method is most likely to respect the Condorcet principle
• scientific article; zbMATH DE number 1071776
• Dictionaries
• Mathematical structure of voting paradoxes. II: Positional voting

Cites work

• A dictionary for voting paradoxes
• Aggregation of Preferences with Variable Electorate
• Consistency of decision processes
• Inconsistencies of Weighted Summation Voting Systems
• Paradoxes of Preferential Voting
• Relationship admitting families of candidates
• Symmetry, voting, and social choice
• The ultimate of chaos resulting from weighted voting systems

Cited in

(37)

• Monotonic incompatibility between electing and ranking
• A dictionary for voting paradoxes
• Choice by vectorial pseudocriteria
• The aggregated excess demand function and other aggregation procedures
• The Borda method is most likely to respect the Condorcet principle
• The probability that all weighted scoring rules elect the same winner
• A comparison of some distance-based choice rules in ranking environments
• Explaining all three-alternative voting outcomes
• Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
• The Borda class. An axiomatic study of the Borda rule on top-truncated preferences
• Weighted scoring elections: is Borda best?
• The Borda rule and the pairwise-majority-loser revisited
• A characterization of the Borda rule in peer ratings
• The traveling group problem
• The Efron dice voting system
• The original Borda count and partial voting
• Robustness against inefficient manipulation
• Is majority consistency possible?
• A conjecture on the construction of orderings by Borda's rule
• Should voters be required to rank candidates in an election?
• Consistency of choice in nonparametric multiple comparisons
• Chaos, but in voting and apportionments?
• Paradoxes in nonparametric tests
• Ranking-based voting revisited: maximum entropy approach leads to Borda count (and its versions)
• The Condorcet efficiency of Borda Rule with anonymous voters
• Distance on matchings: An axiomatic approach
• Construction of aggregation paradoxes through load-sharing models
• The Borda and Condorcet winners coincide for lexicographic preferences
• The Colley Method is an Extension of the Borda Count
• Another perspective on Borda's paradox
• Condorcet vs. Borda in light of a dual majoritarian approach
• Relationship admitting families of candidates
• Scoring rules: an alternative parameterization
• The costs of implementing the majority principle: The golden voting rule
• Scoring rules over subsets of alternatives: consistency and paradoxes
• On eligibility by the de Borda voting rules
• Nash implementable domains for the Borda count

This page was built for publication: The Borda dictionary

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