Parameterized aspects of distinct Kemeny rank aggregation

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Acta Informatica Pub Date : 2024-08-15 DOI:10.1007/s00236-024-00463-x

Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra

引用次数: 0

Abstract

The Kemeny method is one of the popular tools for rank aggregation. However, computing an optimal Kemeny ranking is \(\textsf{NP}\)-hard. Consequently, the computational task of finding a Kemeny ranking has been studied under the lens of parameterized complexity with respect to many parameters. We study the parameterized complexity of the problem of computing all distinct Kemeny rankings. We consider the target Kemeny score, number of candidates, average distance of input rankings, maximum range of any candidate, and unanimity width as our parameters. For all these parameters, we already have \(\textsf{FPT}\) algorithms. We find that any desirable number of Kemeny rankings can also be found without substantial increase in running time. We also present \(\textsf{FPT}\) approximation algorithms for Kemeny rank aggregation with respect to these parameters.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

不同凯门尼等级聚合的参数化方面

Kemeny 方法是排名聚合的常用工具之一。然而，计算一个最优的凯美尼排名是非常困难的。因此，人们在参数化复杂性的视角下研究了寻找凯美尼排序的计算任务。我们研究计算所有不同的凯门尼排名问题的参数化复杂度。我们将目标凯门尼得分、候选者数量、输入排名的平均距离、任何候选者的最大范围和一致度宽度作为参数。对于所有这些参数，我们已经有了（\textsf{FPT}\）算法。我们发现，在不大幅增加运行时间的情况下，也可以找到任何理想数量的凯门尼排名。我们还提出了与这些参数相关的凯门尼排序聚合的 \(\textsf{FPT}\) 近似算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.

期刊最新文献

Comparative genomics with succinct colored de Bruijn graphs Editorial 2024: moving forwards in the electronic age Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm Linear-size suffix tries and linear-size CDAWGs simplified and improved Parameterized aspects of distinct Kemeny rank aggregation