DeepAI AI Chat
Log In Sign Up

Dynamic Proportional Rankings

by   Jonas Israel, et al.

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q A platforms, where submitted questions need to be ranked based on the interests of the audience, we study a dynamic extension of the proportional rankings setting. In our setting, the goal is to maintain the proportionality of a ranking when alternatives (i.e., questions) – not necessarily from the top of the ranking – get selected sequentially. We propose generalizations of well-known aggregation rules to this setting and study their monotonicity and proportionality properties. We also evaluate the performance of these rules experimentally, using realistic probabilistic assumptions on the selection procedure.


page 1

page 2

page 3

page 4


Proportional Rankings

In this paper we extend the principle of proportional representation to ...

Rank Aggregation Using Scoring Rules

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

Optimizing positional scoring rules for rank aggregation

Nowadays, several crowdsourcing projects exploit social choice methods f...

Proportional Ranking in Primary Elections: A Case Study

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

Efficient Probabilistic Inference with Partial Ranking Queries

Distributions over rankings are used to model data in various settings s...

Invidious Comparisons: Ranking and Selection as Compound Decisions

There is an innate human tendency, one might call it the "league table m...

A comparative study of scoring systems by simulations

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