20 citations · 81 across the 30 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.MA2017
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…
cs.DS2017
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
Palash Dey
This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.
cs.GT2017★ 5 cited
Proportional Representation in Vote Streams
Palash Dey, Nimrod Talmon, Otniel van Handel
We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respec…