20 citations · 81 across the 30 of their papers we have counts for
6 papers · 1 filter
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…
Fishing out Winners from Vote Streams
Arnab Bhattacharyya, Palash Dey
We investigate the problem of winner determination from computational social choice theory in the data stream model. Specifically, we consider the task of summarizing an arbitraril…
Estimating the Margin of Victory of an Election using Sampling
Palash Dey, Y. Narahari
The margin of victory of an election is a useful measure to capture the robustness of an election outcome. It also plays a crucial role in determining the sample size of various al…
Manipulation is Harder with Incomplete Votes
Palash Dey, Neeldhara Misra, Y. Narahari
The Coalitional Manipulation (CM) problem has been studied extensively in the literature for many voting rules. The CM problem, however, has been studied only in the complete infor…
Frugal Bribery in Voting
Palash Dey, Neeldhara Misra, Y. Narahari
Bribery in elections is an important problem in computational social choice theory. However, bribery with money is often illegal in elections. Motivated by this, we introduce the n…
Sample Complexity for Winner Prediction in Elections
Arnab Bhattacharyya, Palash Dey
Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the prefere…