2 citations · 2 across the 7 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
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…
cs.GT2025
Identifying Imperfect Clones in Elections
Piotr Faliszewski, Lukasz Janeczko, Grzegorz Lisowski +2
A perfect clone in an ordinal election (i.e., an election where the voters rank the candidates in a strict linear order) is a set of candidates that each voter ranks consecutively.…