Abstract. In the field of computational social choice, structure in preferences is often described by so-called domain re- strictions.

In the field of computational social choice, structure in preferences is often described by so-called domain restrictions. Domain restrictions are of major ...

By finding the number of single-peaked preference profiles we find the probability that there exists a solution for the single-peaked consistency problem.

We investigate the problem of deciding whether a given preference profile is close to having a certain nice structure, as for instance single-peaked, ...

The goal of this paper is to extend this line of research to the setting where voters' preferences are dichotomous, i.e., each voter approves a subset of ...

Prefer- ence profiles (sets of linear orders) are mathematically rich structures and there is hope for a similarly diverse and powerful classification of ...

Abstract. We investigate the problem of deciding whether a given preference profile is close to a nicely structured preference profile of a certain type, as.

Abstract. We investigate the problem of deciding whether a given preference profile is close to a nicely structured preference profile of a certain type, as.

Apr 19, 2021 · In this work, we propose a model that explains how users' listening preferences develop over the course of several years.

Abstract. We propose a theoretical framework under which preference profiles can be meaningfully compared. Specifically, we first define the ranking vector ...