122 citations · 409 across the 73 of their papers we have counts for
88 papers
Outer Diversity of Condorcet Domains
Piotr Faliszewski, Jan Jabrocki, Mateusz Słuszniak +3
A Condorcet domain is a set of rankings over a given candidate set, such that every election that consists only of (an odd number of) votes from the domain has a transitive majorit…
Nearly Group-Separable Elections
Piotr Faliszewski, Jan Jabrocki, Stanisław Kaźmierowski +3
We study the problem of computing how close a given election is to being group-separable, measuring proximity by swaps of adjacent candidates in the votes. We also consider several…
Agreement, Diversity, and Polarization Indices for Approval Elections
Piotr Faliszewski, Jitka Mertlová, Krzysztof Sornat +2
An index is a function that given an election outputs a value between 0 and 1, indicating the extent to which this election has a particular feature. We seek indices that capture a…
Computational Social Choice: Research & Development
Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer +7
Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effo…
Outer Diversity of Structured Domains
Piotr Faliszewski, Krzysztof Sornat, Stanisław Szufa +1
An ordinal preference domain is a subset of preference orders that the voters are allowed to cast in an election. We introduce and study the notion of outer diversity of a domain a…
How Similar Are Two Elections?
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko +3
We introduce and study isomorphic distances between ordinal elections (with the same numbers of candidates and voters). The main feature of these distances is that they are invaria…