An efficient approach for the rank aggregation problem
From MaRDI portal
Publication:2503315
DOI10.1016/j.tcs.2006.05.024zbMath1097.68138OpenAlexW1979106445MaRDI QIDQ2503315
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.024
rankingassignment problemrank aggregation problembipartite matching of given cardinality and weightstring distance
Related Items (5)
A project portfolio selection problem in a group decision-making context ⋮ A note on permutations and rank aggregation ⋮ Fuzzy K-Minpen Clustering and K-nearest-minpen Classification Procedures Incorporating Generic Distance-Based Penalty Minimizers ⋮ Aggregating preferences represented by conditional preference networks ⋮ From rankings’ collinearity to counting SDR's via chromatic list expression
Cites Work
- Solving a combinatorial problem with network flows
- Topology of strings: median string is NP-complete
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
- Finding all minimum-cost perfect matchings in Bipartite graphs
- A Consistent Extension of Condorcet’s Election Principle
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient approach for the rank aggregation problem