Log In Sign Up

On absolutely and simply popular rankings

by   Sonja Kraiczy, et al.

Van Zuylen et al. introduced the notion of a popular ranking in a voting context, where each voter submits a strictly-ordered list of all candidates. A popular ranking π of the candidates is at least as good as any other ranking σ in the following sense: if we compare π to σ, at least half of all voters will always weakly prefer π. Whether a voter prefers one ranking to another is calculated based on the Kendall distance. A more traditional definition of popularity – as applied to popular matchings, a well-established topic in computational social choice – is stricter, because it requires at least half of the voters who are not indifferent between π and σ to prefer π. In this paper, we derive structural and algorithmic results in both settings, also improving upon the results by van Zuylen et al. We also point out strong connections to the famous open problem of finding a Kemeny consensus with 3 voters.


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...

On the Linear Ordering Problem and the Rankability of Data

In 2019, Anderson et al. proposed the concept of rankability, which refe...

On the best-choice prophet secretary problem

We study a variant of the secretary problem where candidates come from i...

A Note on the Significance Adjustment for FA*IR with Two Protected Groups

In this report we provide an improvement of the significance adjustment ...

Fishing out Winners from Vote Streams

We investigate the problem of winner determination from computational so...

Kemeny Consensus Complexity

The computational study of election problems generally focuses on questi...

Consensus ranking under the exponential model

We analyze the generalized Mallows model, a popular exponential model ov...