1 citations · 1 across the 9 of their papers we have counts for
12 papers
Diversity of Structured Domains via k-Kemeny Scores
Piotr Faliszewski, Krzysztof Sornat, Stanisław Szufa +1
In the k-Kemeny problem, we are given an ordinal election, i.e., a collection of votes ranking the candidates from best to worst, and we seek the smallest number of swaps of adjace…
Putting Fair Division on the Map
Paula Böhm, Robert Bredereck, Paul Gölz +2
The fair division of indivisible goods is not only a subject of theoretical research, but also an important problem in practice, with solutions being offered on several online plat…
Drawing a Map of Elections
Stanisław Szufa, Niclas Boehmer, Robert Bredereck +5
Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of or…
Discovering Consistent Subelections
Łukasz Janeczko, Jérôme Lang, Grzegorz Lisowski +1
We show how hidden interesting subelections can be discovered in ordinal elections. An interesting subelection consists of a reasonably large set of voters and a reasonably large s…
Guide to Numerical Experiments on Elections in Computational Social Choice
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +7
We analyze how numerical experiments regarding elections were conducted within the computational social choice literature (focusing on papers published in the IJCAI, AAAI, and AAMA…
Single-Winner Voting with Alliances: Avoiding the Spoiler Effect
Grzegorz Pierczyński, Stanisław Szufa
We study the setting of single-winner elections with ordinal preferences where candidates might be members of \emph{alliances} (which may correspond to e.g., political parties, fac…