The Dodgson ranking and the Borda count: a binary comparison
From MaRDI portal
(Redirected from Publication:1887443)
Recommendations
- A comparison of Dodgson's method and the Borda count
- Binary Probabilities Induced by Rankings
- The Dodgson ranking and its relation to Kemeny's method and Slater's rule
- Ranking-based voting revisited: maximum entropy approach leads to Borda count (and its versions)
- On the (numerical) ranking associated with any finite binary relation
- Cardinality and the Borda score
- The Borda count with weak preferences
- Binary choice probabilities and rankings
Cites work
- A comparison of Dodgson's method and Kemeny's rule
- A comparison of Dodgson's method and the Borda count
- Basic Geometry of Voting
- Condorcet choice correspondences: A set-theoretical comparison
- Condorcet Social Choice Functions
- scientific article; zbMATH DE number 4005933 (Why is no real title available?)
- The Dodgson ranking and its relation to Kemeny's method and Slater's rule
- Tournament solutions and majority voting
Cited in
(8)- Approximability of Dodgson's rule
- On the approximability of Dodgson and Young elections
- The Dodgson ranking and its relation to Kemeny's method and Slater's rule
- A comparison of Dodgson's method and the Borda count
- Using the Borda rule for ranking sets of objects
- A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules
- A linguistic fuzzy approach to the consensus reaching in multiple criteria group decision-making problems
- Neural voting machines
This page was built for publication: The Dodgson ranking and the Borda count: a binary comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887443)
