6 citations · 10 across the 25 of their papers we have counts for
29 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…
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…
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…
Learning Real-Life Approval Elections
Piotr Faliszewski, Łukasz Janeczko, Andrzej Kaczmarczyk +3
We study the independent approval model (IAM) for approval elections, where each candidate has its own approval probability and is approved independently of the other ones. This mo…
Maps of Tournaments: Distances, Experiments, and Data
Filip Nikolow, Piotr Faliszewski, Stanisław Szufa
We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an e…
Distances Between Top-Truncated Elections of Different Sizes
Piotr Faliszewski, Jitka Mertlová, Pierre Nunn +2
The map of elections framework is a methodology for visualizing and analyzing election datasets. So far, the framework was restricted to elections that have equal numbers of candid…
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…
Strategic Cost Selection in Participatory Budgeting
Piotr Faliszewski, Łukasz Janeczko, Andrzej Kaczmarczyk +3
We study strategic behavior of project proposers in the context of approval-based participatory budgeting (PB). In our model we assume that the votes are fixed and known and the pr…
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…
Map of Elections
Stanisław Szufa
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…
Selecting the Most Conflicting Pair of Candidates
Théo Delemazure, Łukasz Janeczko, Andrzej Kaczmarczyk +1
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.…
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…
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections
Piotr Faliszewski, Martin Lackner, Krzysztof Sornat +1
In this paper, we experimentally compare major approval-based multiwinner voting rules. To this end, we define a measure of similarity between two equal-sized committees subject to…
Evaluation of Project Performance in Participatory Budgeting
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +5
We study ways of evaluating the performance of losing projects in participatory budgeting (PB) elections by seeking actions that would have led to their victory. We focus on loweri…
Nonparametric Detection of Gerrymandering in Multiparty Elections
Wojciech Słomczyński, Dariusz Stolicki, Stanisław Szufa
Partisan gerrymandering, i.e., manipulation of electoral district boundaries for political advantage, is one of the major challenges to election integrity in modern day democracies…
Participatory Budgeting: Data, Tools, and Analysis
Piotr Faliszewski, Jarosław Flis, Dominik Peters +5
We provide a library of participatory budgeting data (Pabulib) and open source tools (Pabutools and Pabustats) for analysing this data. We analyse how the results of participatory…
Diversity, Agreement, and Polarization in Elections
Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat +2
We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice…
How to Sample Approval Elections?
Stanisław Szufa, Piotr Faliszewski, Łukasz Janeczko +4
We study the multifaceted question of how to sample approval elections in a meaningful way. Our analysis aims to discern the properties of various statistical cultures (both establ…
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning
Niclas Boehmer, Robert Bredereck, Edith Elkind +2
We use the ``map of elections'' approach of Szufa et al. (AAMAS-2020) to analyze several well-known vote distributions. For each of them, we give an explicit formula or an efficien…
Understanding Distance Measures Among Elections
Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier +2
Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challengin…