DeepAI AI Chat
Log In Sign Up

Optimizing positional scoring rules for rank aggregation

by   Ioannis Caragiannis, et al.
University of Patras

Nowadays, several crowdsourcing projects exploit social choice methods for computing an aggregate ranking of alternatives given individual rankings provided by workers. Motivated by such systems, we consider a setting where each worker is asked to rank a fixed (small) number of alternatives and, then, a positional scoring rule is used to compute the aggregate ranking. Among the apparently infinite such rules, what is the best one to use? To answer this question, we assume that we have partial access to an underlying true ranking. Then, the important optimization problem to be solved is to compute the positional scoring rule whose outcome, when applied to the profile of individual rankings, is as close as possible to the part of the underlying true ranking we know. We study this fundamental problem from a theoretical viewpoint and present positive and negative complexity results and, furthermore, complement our theoretical findings with experiments on real-world and synthetic data.


page 1

page 2

page 3

page 4


Rank Aggregation Using Scoring Rules

To aggregate rankings into a social ranking, one can use scoring systems...

How should we score athletes and candidates: geometric scoring rules

Individual rankings are often aggregated using scoring rules: each posit...

A comparative study of scoring systems by simulations

Scoring rules aggregate individual rankings by assigning some points to ...

Dynamic Proportional Rankings

Proportional ranking rules aggregate approval-style preferences of agent...

Balancedness of Social Choice Correspondences

A social choice correspondence satisfies balancedness if, for every pair...

Parameterized Aspects of Distinct Kemeny Rank Aggregation

The Kemeny method is one of the popular tools for rank aggregation. Howe...

Who is in Your Top Three? Optimizing Learning in Elections with Many Candidates

Elections and opinion polls often have many candidates, with the aim to ...