A note on permutations and rank aggregation
From MaRDI portal
Recommendations
Cites work
- A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
- A generalization of the assignment problem, and its application to the rank aggregation problem
- A geometric examination of Kemeny's rule
- A multi-criteria decision method based on rank distance
- A theory of measuring, electing, and ranking
- An approach to nonlinear programming
- An efficient approach for the rank aggregation problem
- Combinatorial matrix classes
- Comparing Partial Rankings
- Complexity and the geometry of voting
- Consistency without neutrality in voting rules: When is a vote an average?
- Geometry of voting
- scientific article; zbMATH DE number 2053216 (Why is no real title available?)
- Mathematics and voting
- Network flows. Theory, algorithms, and applications.
- Rank aggregation: together we're strong
Cited in
(6)
This page was built for publication: A note on permutations and rank aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611777)