122 citations · 409 across the 73 of their papers we have counts for
6 papers · 1 filter
Elections with Few Voters: Candidate Control Can Be Easy
Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier +1
We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with re…
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Robert Bredereck, Jiehua Chen, Piotr Faliszewski +3
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (…
Combinatorial Voter Control in Elections
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski +2
Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who wou…
Possible Winners in Noisy Elections
Krzysztof Wojtas, Krzysztof Magiera, Tomasz Miąsko +1
We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with the…
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation
Piotr Skowron, Piotr Faliszewski, Jerome Lang
We consider the following problem: There is a set of items (e.g., movies) and a group of agents (e.g., passengers on a plane); each agent has some intrinsic utility for each of the…
Cloning in Elections: Finding the Possible Winners
Edith Elkind, Piotr Faliszewski, Arkadii Slinko
We consider the problem of manipulating elections by cloning candidates. In our model, a manipulator can replace each candidate c by several clones, i.e., new candidates that are s…