Proportional Rankings

by   Piotr Skowron, et al.

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that cohesive groups of voters are represented proportionally in each initial segment of the ranking. Proportional rankings are desirable in situations where initial segments of different lengths may be relevant, e.g., hiring decisions (if it is unclear how many positions are to be filled), the presentation of competing proposals on a liquid democracy platform (if it is unclear how many proposals participants are taking into consideration), or recommender systems (if a ranking has to accommodate different user types). We study the proportional representation provided by several ranking methods and prove theoretical guarantees. Furthermore, we experimentally evaluate these methods and present preliminary evidence as to which methods are most suitable for producing proportional rankings.


Dynamic Proportional Rankings

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

Proportional Ranking in Primary Elections: A Case Study

Many democratic political parties hold primary elections, which nicely r...

The Schulze Method of Voting

We propose a new single-winner election method ("Schulze method") and pr...

Nonlocal PageRank

In this work we introduce and study a nonlocal version of the PageRank. ...

Submodular Kernels for Efficient Rankings

Many algorithms for ranked data become computationally intractable as th...

The few-get-richer: a surprising consequence of popularity-based rankings

Ranking algorithms play a crucial role in online platforms ranging from ...

Learning Product Rankings Robust to Fake Users

In many online platforms, customers' decisions are substantially influen...

Please sign up or login with your details

Forgot password? Click here to reset