1 citations · 1 across the 7 of their papers we have counts for
6 papers
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…
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +1
We study the robustness of approval-based participatory budgeting (PB) rules to random noise in the votes. Our contributions are twofold. First, we study the computational complexi…
Ties in Multiwinner Approval Voting
Łukasz Janeczko, Piotr Faliszewski
We study the complexity of deciding whether there is a tie in a given approval-based multiwinner election, as well as the complexity of counting tied winning committees. We conside…
Properties of Position Matrices and Their Elections
Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski +4
We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix).…
The Complexity of Proportionality Degree in Committee Elections
Łukasz Janeczko, Piotr Faliszewski
Over the last few years, researchers have put significant effort into understanding of the notion of proportional representation in committee election. In particular, recently they…
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…