Author

Author

Sort by: Order: Results:

  • Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)
    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 manipulators know the votes of ...
  • Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (Cornell University Library, 2019-05)
    We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and ...
  • Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)
    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 preference elicitation ...

Search Digital Repository


Browse

My Account