The goal of this paper is to analyze the complexity of constructive/destructive bribery and
destructive control in the framework of group identification. Group identification applies to …

A variety of constructive manipulation, control, and bribery for approval-based multi-winner
voting have been extensively studied very recently. However, their destructive counterparts …

We study approval-based multiwinner voting where candidates are in a metric space and
committees are valuated in terms of their distances to the given votes. In particular, we …

This article proposes private intersection weighted sum (PIWS), a scalable, fair, and privacy-
preserving intersection weighted sum protocol and applies it to voting scenarios. The PIWS …

We propose a secure voting protocol for score-based voting rules, where independent
talliers perform the tallying procedure. The protocol outputs the winning candidate (s) while …

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

Consolidation-disruption index (CD index) is a new metric for qualitatively measuring the
contribution of a patent or a research paper. We embark on the study of the complexity of the …

The successive and the amendment procedures have been widely employed in
parliamentary and legislative decision making and have undergone extensive study in 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 …

In parliamentary elections, parties compete for a limited, typically fixed number of seats. We
study the complexity of the following bribery-style problem: Given the distribution of votes …