20 citations · 20 across the 2 of their papers we have counts for
5 papers
Preference Elicitation For Single Crossing Domain
Palash Dey, Neeldhara Misra
Eliciting the preferences of a set of agents over a set of alternatives is a problem of fundamental importance in social choice theory. Prior work on this problem has studied the q…
Elicitation for Preferences Single Peaked on Trees
Palash Dey, Neeldhara Misra
In multiagent systems, we often have a set of agents each of which have a preference ordering over a set of items and one would like to know these preference orderings for various…
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems
Arnab Bhattacharyya, Palash Dey, David P. Woodruff
We give the first optimal bounds for returning the -heavy hitters in a data stream of insertions, together with their approximate frequencies, closing a long line of work o…
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…