
The Complexity of Subelection Isomorphism Problems
We study extensions of the Election Isomorphism problem, focused on the ...
read it

Putting a Compass on the Map of Elections
Recently, Szufa et al. [AAMAS 2020] presented a "map of elections" that ...
read it

Bribery as a Measure of Candidate Success: Complexity Results for ApprovalBased Multiwinner Rules
We study the problem of bribery in multiwinner elections, for the case w...
read it

On the Robustness of Winners: Counting Briberies in Elections
We study the parameterized complexity of counting variants of Swap and ...
read it

Opinion Diffusion and Campaigning on Society Graphs
We study the effects of campaigning, where the society is partitioned in...
read it

LineUp Elections: Parallel Voting with Shared Candidate Pool
We introduce the model of lineup elections which captures parallel or s...
read it

Approximation and Hardness of ShiftBribery
In the ShiftBribery problem we are given an election, a preferred candi...
read it

What Do Multiwinner Voting Rules Do? An Experiment Over the TwoDimensional Euclidean Domain
We visualize aggregate outputs of popular multiwinner voting rulesSNTV...
read it

Algorithms for Destructive Shift Bribery
We study the complexity of Destructive Shift Bribery. In this problem, w...
read it

A Framework for Approvalbased Budgeting Methods
We define and study a general framework for approvalbased budgeting met...
read it

Committee Scoring Rules: Axiomatic Characterization and Hierarchy
Committee scoring voting rules are multiwinner analogues of positional s...
read it

The Complexity of Multiwinner Voting Rules with Variable Number of Winners
We consider the approvalbased model of elections, and undertake a compu...
read it

Multiwinner Elections with Diversity Constraints
We develop a model of multiwinner elections that combines performanceba...
read it

Mixed Integer Programming with Convex/Concave Constraints: FixedParameter Tractability and Applications to Multicovering and Voting
A classic result of Lenstra [Math. Oper. Res. 1983] says that an integer...
read it

Robustness Among Multiwinner Voting Rules
We investigate how robust are results of committee elections to small ch...
read it

Complexity of Shift Bribery in Committee Elections
We study the (parameterized) complexity of SHIFT BRIBERY for multiwinner...
read it

Elections with Few Voters: Candidate Control Can Be Easy
We study the computational complexity of candidate control in elections ...
read it

Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation
We consider the following problem: There is a set of items (e.g., movies...
read it

Achieving Fully Proportional Representation: Approximability Results
We study the complexity of (approximate) winner determination under the ...
read it
Piotr Faliszewski
is this you? claim profile