20 citations · 81 across the 30 of their papers we have counts for
7 papers · 1 filter
Query Complexity of Tournament Solutions
Arnab Maiti, Palash Dey
A directed graph where there is exactly one edge between every pair of vertices is called a {\em tournament}. Finding the "best" set of vertices of a tournament is a well studied p…
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
Palash Dey
We introduce and study the weakly single-crossing domain on trees which is a generalization of the well-studied single-crossing domain in social choice theory. We design a polynomi…
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…
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…
Complexity of Manipulation with Partial Information in Voting
Palash Dey, Neeldhara Misra, Y. Narahari
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, w…