Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Analysis of algorithms (68W40)
Recommendations
Cited in
(39)- Fixed-parameter algorithms for Kemeny rankings
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Rank aggregation: new bounds for MCx
- Robust Plackett-Luce model for k-ary crowdsourced preferences
- Partial evaluation in rank aggregation problems
- Exploring the median of permutations problem
- Using extension sets to aggregate partial rankings in a flexible setting
- Iterative ranking aggregation using quality improvement of subgroup ranking
- Approximate and dynamic rank aggregation
- Recursive inversion models for permutations
- Space reduction constraints for the median of permutations problem
- Automedian sets of permutations: direct sum and shuffle
- A new approach for identifying the Kemeny median ranking
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Median constrained bucket order rank aggregation
- Approaching the rank aggregation problem by local search-based metaheuristics
- A data-driven matching algorithm for ride pooling problem
- An algorithmic view of voting
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Partial kernelization for rank aggregation: theory and experiments
- Approximate rank aggregation (preliminary version)
- Combining initial segments of lists
- Rank aggregation for metasearch engines using a self-adaptating genetic algorithm with multiple genomic representations
- Combining initial segments of lists
- Experiments with Kemeny ranking: What works when?
- Comparison of rank aggregation methods based on inherent ability
- Collaborative Rankings
- Robust Learning of Consumer Preferences
- Rank aggregation in cyclic sequences
- scientific article; zbMATH DE number 2200791 (Why is no real title available?)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- A note on permutations and rank aggregation
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Parameterized aspects of distinct Kemeny rank aggregation
- Parameterized aspects of distinct Kemeny rank aggregation
- Integrating multiple sources of ordinal information in portfolio optimization
- Average parameterization and partial kernelization for computing medians
- Photo sequencing
This page was built for publication: Rank aggregation: together we're strong
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233564)
