4 citations · 4 across the 3 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2016★ 4 cited
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard
Palash Dey, Neeldhara Misra
We consider election scenarios with incomplete information, a situation that arises often in practice. There are several models of incomplete information and accordingly, different…
cs.GT2014
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting
Palash Dey, Neeldhara Misra, Y. Narahari
In the Possible Winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made…