#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2010

2018

- This year (2)
- Last 5 years (26)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Arnab Bhattacharyya, Palash Dey
- Electronic Colloquium on Computational Complexity
- 2015

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 preferences of all theâ€¦ (More)

- Palash Dey, Neeldhara Misra
- IJCAI
- 2016

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 tasks, for example,â€¦ (More)

- Palash Dey, Neeldhara Misra
- IJCAI
- 2016

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 query complexity ofâ€¦ (More)

- Palash Dey, Neeldhara Misra, Y. Narahari
- AAMAS
- 2015

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 winner by extendingâ€¦ (More)

- Palash Dey, Neeldhara Misra, Y. Narahari
- AAAI
- 2016

Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $BRIBERY problem, namely, FRUGAL-BRIBERY andâ€¦ (More)

- Palash Dey, Neeldhara Misra, Y. Narahari
- Theor. Comput. Sci.
- 2016

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, wherein theâ€¦ (More)

- Arnab Bhattacharyya, Palash Dey, David P. Woodruff
- PODS
- 2016

We give the first optimal bounds for returning the l<sub>1</sub>-heavy hitters in a data stream of insertions, together with their approximate frequencies, closing a long line of work on thisâ€¦ (More)

- Palash Dey, Y. Narahari
- IJCAI
- 2015

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 algorithms in postâ€¦ (More)

- Palash Dey, Neeldhara Misra, Y. Narahari
- AAMAS
- 2015

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 of an alternativeâ€¦ (More)

- Arnab Bhattacharyya, Palash Dey
- Electronic Colloquium on Computational Complexity
- 2015

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 arbitrarily ordered stream ofâ€¦ (More)