Robust winner determination in positional scoring rules with uncertain weights

摘要

Scoring rules constitute a particularly popular technique for aggregating a set of rankings. However, setting the weights associated with rank positions is a crucial task, as different instantiations of the weights can often lead to different winners. In this work we adopt minimax regret as a robust criterion for determining the winner in the presence of uncertainty over the weights. Focusing on two general settings (non-increasing weights and convex sequences of non-increasing weights) we provide a characterization of the minimax regret rule in terms of cumulative ranks, allowing a quick computation of the winner. We then analyze the properties of using minimax regret as a social choice function. Finally we provide some test cases of rank aggregation using the proposed method.