activity
20202026
collaborators

5 papers

cs.AI2026

Efficient Elicitation of Collective Disagreements

Mohamed Ouaguenouni, Felipe Garrido-Lucero, Umberto Grandi +2

We analyze the structure of the disagreement among a population of voters over a set of alternatives. Surveys typically ask either for pairwise comparisons, simple and intuitive fo…

cs.GT2024

Comparing Ways of Obtaining Candidate Orderings from Approval Ballots

Théo Delemazure, Chris Dong, Dominik Peters +1

To understand and summarize approval preferences and other binary evaluation data, it is useful to order the items on an axis which explains the data. In a political election using…

math.MG2022

Euclidean preferences in the plane under , and norms

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

We present various results about Euclidean preferences in the plane under , and norms. When there are four candidates, we show that the maximal siz…

cs.DM2021

Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

The assumption that voters' preferences share some common structure is a standard way to circumvent NP-hardness results in social choice problems. While the Kemeny ranking problem…

cs.GT2020

Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová

This paper is devoted to a study of single-peakedness on arbitrary graphs. Given a collection of preferences (rankings of a set of alternatives), we aim at determining a connected…