20 citations · 81 across the 30 of their papers we have counts for
6 papers · 1 filter
A Parameterized Perspective on Protecting Elections
Palash Dey, Neeldhara Misra, Swaprava Nath +1
We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a…
Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences
Palash Dey
Lu and Boutilier proposed a novel approach based on "minimax regret" to use classical score based voting rules in the setting where preferences can be any partial (instead of compl…
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
Palash Dey
We introduce and study the weakly single-crossing domain on trees which is a generalization of the well-studied single-crossing domain in social choice theory. We design a polynomi…
Complexity of Manipulation with Partial Information in Voting
Palash Dey, Neeldhara Misra, Y. Narahari
The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, w…
On Choosing Committees Based on Approval Votes in the Presence of Outliers
Palash Dey, Neeldhara Misra, Y. Narahari
We study the computational complexity of committee selection problem for several approval-based voting rules in the presence of outliers. Our first result shows that outlier consid…
Detecting Possible Manipulators in Elections
Palash Dey, Neeldhara Misra, Y. Narahari
Manipulation is a problem of fundamental importance in the context of voting in which the voters exercise their votes strategically instead of voting honestly to prevent selection…