A note on permutations and rank aggregation

DOI10.1016/j.mcm.2010.02.052zbMath1201.91048OpenAlexW1996961557MaRDI QIDQ611777

Harald Minken, Geir Dahl

Publication date: 14 December 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2010.02.052

zbMATH Keywords

permutationsrankingvotingassignment problem

Mathematics Subject Classification ID

Voting theory (91B12) Discrete location and assignment (90B80) Social choice (91B14)

Cites Work

• A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
• Geometry of voting
• A geometric examination of Kemeny's rule
• Complexity and the geometry of voting
• Consistency without neutrality in voting rules: When is a vote an average?
• An efficient approach for the rank aggregation problem
• An approach to nonlinear programming
• Rank Aggregation: Together We're Strong
• A theory of measuring, electing, and ranking
• Comparing Partial Rankings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on permutations and rank aggregation