Log In Sign Up

Diversity in Kemeny Rank Aggregation: A Parameterized Approach

by   Emmanuel Arrighi, et al.

In its most traditional setting, the main concern of optimization theory is the search for optimal solutions for instances of a given computational problem. A recent trend of research in artificial intelligence, called solution diversity, has focused on the development of notions of optimality that may be more appropriate in settings where subjectivity is essential. The idea is that instead of aiming at the development of algorithms that output a single optimal solution, the goal is to investigate algorithms that output a small set of sufficiently good solutions that are sufficiently diverse from one another. In this way, the user has the opportunity to choose the solution that is most appropriate to the context at hand. It also displays the richness of the solution space. When combined with techniques from parameterized complexity theory, the paradigm of diversity of solutions offers a powerful algorithmic framework to address problems of practical relevance. In this work, we investigate the impact of this combination in the field of Kemeny Rank Aggregation, a well-studied class of problems lying in the intersection of order theory and social choice theory and also in the field of order theory itself. In particular, we show that the Kemeny Rank Aggregation problem is fixed-parameter tractable with respect to natural parameters providing natural formalizations of the notions of diversity and of the notion of a sufficiently good solution. Our main results work both when considering the traditional setting of aggregation over linearly ordered votes, and in the more general setting where votes are partially ordered.


page 1

page 2

page 3

page 4


Diversity in Combinatorial Optimization

When modeling an application of practical relevance as an instance of a ...

More Effort Towards Multiagent Knapsack

In this paper, we study some multiagent variants of the knapsack problem...

Search-Space Reduction via Essential Vertices

We investigate preprocessing for vertex-subset problems on graphs. While...

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals

Perturbed graphic matroids are binary matroids that can be obtained from...

Egalitarian Judgment Aggregation

Egalitarian considerations play a central role in many areas of social c...


Given a family F⊂ 2^[n], its diversity is the number of sets not contai...