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 lowering …

We investigate the complexity of several manipulation and control problems under
numerous prevalent approval-based multiwinner voting rules. Particularly, the rules we …

Bribery in an election is one of the well-studied control problems in computational social
choice. In this paper, we propose and study the safe bribery problem. Here the goal of the …

We study the parameterized complexity of winner determination problems for three prevalent
k-committee selection rules, namely the minimax approval voting (MAV), the proportional …

We study the complexity of constructive bribery in the context of structured multiwinner
approval elections. Given such an election, we ask whether a certain candidate can join the …

The group identification problem asks to identify a socially qualified subgroup among a
group of individuals based on their pairwise valuations. There are several different rules that …

This paper studies the complexity of two microbribery problems under the model of group
identification. In these problems, we are given a subset of distinguished individuals, and the …

In the Group Identification problem, we are given a set of individuals and are asked to
identify a socially qualified subset among them. Each individual in the set has an opinion …

Over the past few years, the (parameterized) complexity landscape of constructive control for
many prevalent approval-based multiwinner voting (ABMV) rules has been explored. We …

We propose a model of winners allocation. In this model, we are given are two elections
where the sets of candidates may intersect. The goal is to find two disjoint winning …