Selecting the Most Conflicting Pair of Candidates

1 code implementation • 9 May 2024 • Théo Delemazure, Łukasz Janeczko, Andrzej Kaczmarczyk, Stanisław Szufa

We study committee elections from a perspective of finding the most conflicting candidates, that is, candidates that imply the largest amount of conflict, as per voter preferences.

A Map of Diverse Synthetic Stable Roommates Instances

1 code implementation • 8 Aug 2022 • Niclas Boehmer, Klaus Heeger, Stanisław Szufa

Focusing on Stable Roommates (SR) instances, we contribute to the toolbox for conducting experiments for stable matching problems.

Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning

1 code implementation • 16 May 2022 • Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanisław Szufa

We use the ``map of elections'' approach of Szufa et al. (AAMAS-2020) to analyze several well-known vote distributions.

Position