The Borda count, the Kemeny rule, and the permutahedron

zbMATH Open1305.91154MaRDI QIDQ2939697FDOQ2939697

Authors: Karl-Dieter Crisman 

Publication date: 22 January 2015

Recommendations

• Symmetry, voting, and social choice
• Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
• The Borda method is most likely to respect the Condorcet principle
• Combinatorics of Election Scores
• A geometric examination of Kemeny's rule

Mathematics Subject Classification ID

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

Cited In (7)

• Permutations of separable preference orders
• Representation theory of the symmetric group in voting theory and game theory
• Voting, the symmetric group, and representation theory
• Title not available (Why is that?)
• Symmetry, voting, and social choice
• Combinatorics of Election Scores
• Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron

This page was built for publication: The Borda count, the Kemeny rule, and the permutahedron

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