An algorithm for rank aggregation problem

DOI10.1016/J.AMC.2006.12.065MaRDI QIDQ2383708zbMATH OpenOpenAlexFDO

Authors F. Didehvar, Changiz Eslahchi

Publication date 19 September 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.12.065

zbMATH Keywords

expectation matrixrankingTournament

Mathematics Subject Classification ID

Decision theory (91B06) Group preferences (91B10)

Recommendations

• An efficient approach for the rank aggregation problem
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• On maximum rank aggregation problems
• Approximate and dynamic rank aggregation
• Approximate rank aggregation (preliminary version)
• How to aggregate Top-lists: Approximation algorithms via scores and average ranks
• A generalization of the assignment problem, and its application to the rank aggregation problem

Cites work

• Voting schemes for which it can be difficult to tell who won the election

Cited in

(18)

• Fixed-parameter algorithms for Kemeny rankings
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• Lamarckian genetic algorithms applied to the aggregation of preferences
• Approximate and dynamic rank aggregation
• On the hardness of maximum rank aggregation problems
• Median constrained bucket order rank aggregation
• Approaching the rank aggregation problem by local search-based metaheuristics
• On maximum rank aggregation problems
• Approximate rank aggregation (preliminary version)
• scientific article; zbMATH DE number 5940804 (Why is no real title available?)
• A new proposal for fusing individual preference orderings by rank-ordered agents: a generalization of the Yager's algorithm
• Rank aggregation in cyclic sequences
• A novel algorithm for fusing preference orderings by rank-ordered agents
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• A generalization of the assignment problem, and its application to the rank aggregation problem
• A note on permutations and rank aggregation
• Approximate Condorcet partitioning: solving large-scale rank aggregation problems
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem

This page was built for publication: An algorithm for rank aggregation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383708)