Subjects

Subjects

Sort by: Order: Results:

  • Complexity of manipulation with partial information in voting 
    Deya, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2018-03)
    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 ...
  • Frugal bribery in voting 
    Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2017-05)
    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 Frugal-$bribery where the ...
  • On the exact amount of missing information that makes finding possible winners hard 
    Dey, Palash; Misra, Neeldhara (Elsevier, 2023-08)
    In the possible winner problem, we need to compute if a set of partial votes can be completed such that a given candidate wins the election under some specific voting rule. In this paper, we determine the smallest number ...
  • Polynomial-time algorithm for isomorphism of graphs with clique-width at most three 
    Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Elsevier, 2020-06)
    The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. We give a polynomial time graph isomorphism ...

Search Digital Repository


Browse

My Account